Which languages have 4-round zero-knowledge proofs?
| Title | Which languages have 4-round zero-knowledge proofs? |
| Publication Type | Journal Articles |
| Year of Publication | 2008 |
| Authors | Katz J |
| Journal | Theory of Cryptography |
| Pagination | 73 - 88 |
| Date Published | 2008/// |
| 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). |
| DOI | 10.1007/978-3-540-78524-8_5 |