Private Coins versus Public Coins in Interactive Proof Systems

  title={Private Coins versus Public Coins in Interactive Proof Systems},
  author={Shafi Goldwasser and Michael Sipser},
  journal={Advances in Computing Research},
An interactive proof system is a method by which one party of unlimited resources, called the prover, can convince a party of limited resources, call the verifier, of the truth of a proposition. The verifier may toss coins, ask repeated questions of the prover, and run efficient tests upon the prover's responses before deciding whether to be convinced. This extends the familiar proof system implicit in the notion of NP in that there the verifier may not toss coins or speak, but only listen and… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 654 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 278 extracted citations

Interactive Distributed Proofs

View 5 Excerpts
Highly Influenced

On Interactivity in Arthur-Merlin Communication and Stream Computation

Electronic Colloquium on Computational Complexity • 2013
View 7 Excerpts
Method Support
Highly Influenced

On the Lattice Smoothing Parameter Problem

2013 IEEE Conference on Computational Complexity • 2013
View 4 Excerpts
Highly Influenced

A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP

2010 IEEE 25th Annual Conference on Computational Complexity • 2010
View 11 Excerpts
Highly Influenced

Approximate counting by hashing in bounded arithmetic

J. Symb. Log. • 2009
View 9 Excerpts
Highly Influenced

On basing one-way functions on NP-hardness

View 9 Excerpts
Method Support
Highly Influenced

The Computational Complexity of Universal Hashing

View 5 Excerpts
Method Support
Highly Influenced

654 Citations

Citations per Year
Semantic Scholar estimates that this publication has 654 citations based on the available data.

See our FAQ for additional information.