TY - GEN

T1 - Parallel repetition of zero-knowledge proofs and the possibility of basing cryptography on NP-hardness

AU - Pass, Rafael

PY - 2006

Y1 - 2006

N2 - Two long-standing open problems exist on the fringe of Complexity Theory and Cryptography: 1. Does there exist a reduction from an NP-Complete Problem to a one-way function? 2. Do parallelized versions of classical constant-round zero-knowledge proofs for NP conceal every "hard" bit of the witness to the statement proved? We show that, unless the Polynomial-Hierarchy collapses, black-box reductions cannot be used to provide positive answers to both questions.

AB - Two long-standing open problems exist on the fringe of Complexity Theory and Cryptography: 1. Does there exist a reduction from an NP-Complete Problem to a one-way function? 2. Do parallelized versions of classical constant-round zero-knowledge proofs for NP conceal every "hard" bit of the witness to the statement proved? We show that, unless the Polynomial-Hierarchy collapses, black-box reductions cannot be used to provide positive answers to both questions.

UR - http://www.scopus.com/inward/record.url?scp=34247522422&partnerID=8YFLogxK

U2 - 10.1109/CCC.2006.33

DO - 10.1109/CCC.2006.33

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:34247522422

SN - 0769525962

SN - 9780769525969

T3 - Proceedings of the Annual IEEE Conference on Computational Complexity

SP - 96

EP - 108

BT - Proceedings - Twenty-First Annual IEEE Conference on Computational Complexity, CCC 2006

T2 - 21st Annual IEEE Conference on Computational Complexity, CCC 2006

Y2 - 16 July 2006 through 20 July 2006

ER -