Welcome to the resource topic for 2007/265
Title:
Which Languages Have 4-Round Zero-Knowledge Proofs?
Authors: Jonathan Katz
Abstract:We show, unconditionally, that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then \bar L \in MA. 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).
ePrint: https://eprint.iacr.org/2007/265
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .