We consider average-case strengthenings of the traditional assumption that coNP is not contained in AM. Under these assumptions, we rule out generic and potentially non-black-box constructions of various cryptographic primitives (e.g., one-way permutations, collision-resistant hash-functions, constant-round statistically hiding commitments, and constant-round black-box zero-knowledge proofs for NP) from one-way functions, assuming the security reductions are black-box. © 2011 International Association for Cryptologic Research.
CITATION STYLE
Pass, R., Tseng, W. L. D., & Venkitasubramaniam, M. (2011). Towards non-black-box lower bounds in cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6597 LNCS, pp. 579–596). Springer Verlag. https://doi.org/10.1007/978-3-642-19571-6_35
Mendeley helps you to discover research relevant for your work.