Which Languages Have 4-Round Zero-Knowledge Proofs?
| Title | Which Languages Have 4-Round Zero-Knowledge Proofs? |
| Publication Type | Journal Articles |
| Year of Publication | 2012 |
| Authors | Katz J |
| Journal | Journal of cryptology |
| Volume | 25 |
| Issue | 1 |
| Pagination | 41 - 56 |
| Date Published | 2012/// |
| 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. |
| DOI | 10.1007/s00145-010-9081-y |