%0 Journal Article
%J Theory of Cryptography
%D 2008
%T Which languages have 4-round zero-knowledge proofs?
%A Katz, Jonathan
%X 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).
%B Theory of Cryptography
%P 73 - 88
%8 2008///
%G eng
%R 10.1007/978-3-540-78524-8_5