Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

STACS
1997
Springer

favoriteEmaildiscussreport

77views Theoretical Computer Science» more STACS 1997»

Probabilistic Proof Systems - A Survey

13 years 8 months ago

Probabilistic Proof Systems - A Survey

Download web.mit.edu

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.

Oded Goldreich

Real-time Traffic

Probabilistic Checkable Proofs | Probabilistic Proof Systems | Proof Systems | STACS 1997 | Theoretical Computer Science |

claim paper

Related Content

» Exact and Approximate TestingCorrecting of Algebraic Functions A Survey

» Survey of Disjoint NPpairs and Relations to Propositional Proof Systems

» On extracting computations from propositional proofs a survey

» Small PCPs with Low Query Complexity

» A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Syste...

» Towards Automated Proof Support for Probabilistic Distributed Systems

» Probabilistic Automata System Types Parallel Composition and Comparison

» Optimal Acceptors and Optimal Proof Systems

» Probabilistic Proof Systems A Primer

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	STACS
Authors	Oded Goldreich

Comments (0)