Probabilistic Proof Systems

Oded Goldreich
Additional contact information
Oded Goldreich: Weizmann Institute of Science, Department of Applied Mathematics and Computer Science

A chapter in Proceedings of the International Congress of Mathematicians, 1995, pp 1395-1406 from Springer

Abstract: Abstract Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, 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.

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-9078-6_134

Ordering information: This item can be ordered from
http://www.springer.com/9783034890786

DOI: 10.1007/978-3-0348-9078-6_134

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().