Which languages have 4-round zero-knowledge proofs?

TitleWhich languages have 4-round zero-knowledge proofs?
Publication TypeJournal Articles
Year of Publication2008
AuthorsKatz J
JournalTheory of Cryptography
Pagination73 - 88
Date Published2008///
Abstract

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).

DOI10.1007/978-3-540-78524-8_5