The Knowledge Complexity of Interactive Proof Systems.Proofs that Release Minimum Knowledge.Randomness, Interactive Proofs, and Zero-Knowledge--A Survey [Book Review]

Journal of Symbolic Logic 56 (3):1092 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Interactive and probabilistic proof-checking.Luca Trevisan - 2000 - Annals of Pure and Applied Logic 104 (1-3):325-342.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.

Analytics

Added to PP
2010-09-12

Downloads
28 (#138,667)

6 months
10 (#1,198,792)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references