The (True) Complexity of Statistical Zero Knowledge

@inproceedings{Bellare1990TheC,
  title={The (True) Complexity of Statistical Zero Knowledge},
  author={Mihir Bellare and Silvio Micali and Rafail Ostrovsky},
  booktitle={STOC},
  year={1990}
}
Statistical zero-knowledge is a very strong privacy constraint which is not dependent on computational limitations. In this paper we show that given a complexity assumption a much weaker condition su ces to attain statistical zero-knowledge. As a result we are able to simplify statistical zero-knowledge and to better characterize, on many counts, the class of languages that possess statistical zero-knowledge proofs. 
Highly Cited
This paper has 66 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 45 extracted citations

67 Citations

0510'90'96'03'10'17
Citations per Year
Semantic Scholar estimates that this publication has 67 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Knowledge Complexity of Interactive Proofs,

  • S. Goldwasser, S. Micali, C. Racko, The
  • SIAM J. Comput.,
  • 1989
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…