TY - GEN
T1 - Towards non-black-box lower bounds in cryptography
AU - Pass, Rafael
AU - Tseng, Wei Lung Dustin
AU - Venkitasubramaniam, Muthuramakrishnan
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79953200125&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-19571-6_35
DO - 10.1007/978-3-642-19571-6_35
M3 - منشور من مؤتمر
SN - 9783642195709
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 579
EP - 596
BT - Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings
PB - Springer Verlag
T2 - 8th Theory of Cryptography Conference, TCC 2011
Y2 - 28 March 2011 through 30 March 2011
ER -