Theory of Cryptography Conference

TCC 2011: Theory of Cryptography pp 579-596

Towards Non-Black-Box Lower Bounds in Cryptography

  • Rafael Pass
  • Wei-Lung Dustin Tseng
  • Muthuramakrishnan Venkitasubramaniam
Conference paper

DOI: 10.1007/978-3-642-19571-6_35

Volume 6597 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Rafael Pass
    • 1
  • Wei-Lung Dustin Tseng
    • 1
  • Muthuramakrishnan Venkitasubramaniam
    • 1
  1. 1.Cornell UniversityUSA