TY - JOUR
T1 - Which Languages Have 4-Round Zero-Knowledge Proofs?
JF - Journal of cryptology
Y1 - 2012
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 with black-box simulation.
VL - 25
CP - 1
M3 - 10.1007/s00145-010-9081-y
ER -