The complexity of perfect zero-knowledge

@article{Fortnow1987TheCO,
  title={The complexity of perfect zero-knowledge},
  author={Lance Fortnow},
  journal={Advances in Computing Research},
  year={1987},
  volume={5},
  pages={327-343}
}
  • Lance Fortnow
  • Published 1987 in Structure in Complexity Theory Conference
A Perfect Zero-Knowledge interactive proof system convinces a veriier that a string is in a language without revealing any additional knowledge in an information-theoretic sense. We show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol. This result implies that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial time hierarchy collapses. This paper demonstrates that knowledge… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 193 citations. REVIEW CITATIONS

Topics

Statistics

01020'90'93'96'99'02'05'08'11'14'17
Citations per Year

193 Citations

Semantic Scholar estimates that this publication has 193 citations based on the available data.

See our FAQ for additional information.