Which Languages Have 4-Round Zero-Knowledge Proofs?

TitleWhich Languages Have 4-Round Zero-Knowledge Proofs?
Publication TypeJournal Articles
Year of Publication2012
AuthorsKatz J
JournalJournal of cryptology
Volume25
Issue1
Pagination41 - 56
Date Published2012///
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 with black-box simulation.

DOI10.1007/s00145-010-9081-y