TY - JOUR
T1 - Which languages have 4-round zero-knowledge proofs?
JF - Theory of Cryptography
Y1 - 2008
A1 - Katz, Jonathan
AB - We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then . Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs (at least with respect to black-box simulation).
M3 - 10.1007/978-3-540-78524-8_5
ER -