Rational Proofs with Multiple Provers

@article{Chen2016RationalPW,
  title={Rational Proofs with Multiple Provers},
  author={J. Chen and Samuel McCauley and Shikha Singh},
  journal={Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science},
  year={2016}
}
Interactive proofs model a world where a verifier delegates computation to an untrustworthy prover, verifying the prover's claims before accepting them. These proofs have applications to delegation of computation, probabilistically checkable proofs, crowdsourcing, and more. In some of these applications, the verifier may pay the prover based on the quality of his work. Rational proofs, introduced by Azar and Micali (2012), are an interactive proof model in which the prover is rational rather… Expand
16 Citations
Rational Proofs with Non-Cooperative Provers
  • 1
  • PDF
Rational Proofs against Rational Verifiers
  • 7
  • PDF
Rational Sumchecks
  • 23
  • PDF
Non-Cooperative Rational Interactive Proofs
  • 1
  • PDF
G T ] 9 A pr 2 01 8 Rational Proofs with Non-Cooperative Provers
G T ] 1 5 A ug 2 01 9 Non-Cooperative Rational Interactive Proofs ∗
Streaming Verification of Graph Properties
  • 5
  • PDF
Smart contracts meet quantum cryptography
  • 7
  • PDF
Efficient Rational Proofs for Space Bounded Computations
  • 7
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 16 REFERENCES
Rational proofs
  • 31
  • Highly Influential
  • PDF
Rational arguments: single round delegation with sublinear verification
  • 28
  • Highly Influential
  • PDF
Interactive proofs of proximity : Delegating computation in sublinear time
  • 45
  • Highly Influential
Non-deterministic exponential time has two-prover interactive protocols
  • 501
  • Highly Influential
  • PDF
Super-efficient rational proofs
  • 27
  • Highly Influential
  • PDF
Two-prover one-round proof systems: their power and their problems (extended abstract)
  • 256
  • Highly Influential
  • PDF
A game-theoretic classification of interactive complexity classes
  • 47
  • Highly Influential
Algebraic methods for interactive proof systems
  • 421
  • Highly Influential
  • PDF
Making Games Short
  • 38
  • Highly Influential
The Complexity of Two-Player Games of Incomplete Information
  • J. Reif
  • Computer Science
  • J. Comput. Syst. Sci.
  • 1984
  • 304
  • Highly Influential
...
1
2
...