Summary
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this chapter, we concentrate on three such proof systems — interactive proofs, zero-knowledge proofs, and probabilistic checkable proofs — stressing the essential role of randomness in each of them.
A proof is whatever convinces me.
Shimon Even, answering a student’s question in his Graph Algorithms class (1978)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Goldreich, O. (1999). Probabilistic Proof Systems. In: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12521-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-12521-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08432-4
Online ISBN: 978-3-662-12521-2
eBook Packages: Springer Book Archive