Towards Non-Black-Box Lower Bounds in Cryptography
- Cite this paper as:
- Pass R., Tseng WL.D., Venkitasubramaniam M. (2011) Towards Non-Black-Box Lower Bounds in Cryptography. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg
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.