Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science · 2008
DOI: 10.1561/0400000023 ↗At a glance
Journal article in Foundations and Trends® in Theoretical Computer Science, 2008. Written by Oded Goldreich. Cited 5 times so far (Crossref); 51 references.
Abstract (original language)
Various types of probabilistic proof systems have played a central role in the development of computer science in the last couple of decades. These proof systems deviate from the traditional concept of a proof by introducing randomization and interaction into the verification process. Probabilistic proof systems carry an error probability (which is explicitly bounded and can be decreased by repetitions), but they offer various advantages over deterministic proof systems. This primer concentrates on three types of probabilistic proof systems: interactive proofs, zero-knowledge proofs, and Probabilistically Checkable Proofs (PCP). Surveying the basic results regarding these proof systems, we stress the essential role of randomness in each of them.
Cite
APA
Goldreich, O. (2008). Probabilistic Proof Systems: A Primer. Foundations and Trends® in Theoretical Computer Science. https://doi.org/10.1561/0400000023
Vancouver
Goldreich O. Probabilistic Proof Systems: A Primer. Foundations and Trends® in Theoretical Computer Science. 2008. doi:10.1561/0400000023
BibTeX
@article{Goldreich2008,
author = {Goldreich, Oded},
title = {Probabilistic Proof Systems: A Primer},
journal = {Foundations and Trends® in Theoretical Computer Science},
year = {2008},
doi = {10.1561/0400000023}
}
EUVIMED