Rational proofs
We study a new type of proof system, where an unbounded prover and a polynomial time verifier interact, on inputs a string x and a function f, so that the Verifier may learn f(x). The novelty of our setting is that there no longer are "good" or "malicious" provers, but only ratio...
Main Authors: | Azar, Pablo Daniel, Micali, Silvio |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2012
|
Online Access: | http://hdl.handle.net/1721.1/72431 https://orcid.org/0000-0001-9156-2428 https://orcid.org/0000-0002-0816-4064 |
Similar Items
-
Rational proofs
by: Azar, Pablo Daniel, et al.
Published: (2022) -
Super-efficient rational proofs
by: Azar, Pablo Daniel
Published: (2015) -
Copmutationally Sound Proofs
by: Micali, Silvio
Published: (2023) -
More on Proofs of Knowledge
by: Halevi, Shai, et al.
Published: (2023) -
Subcontracted Rational SFE
by: Lepinski, Matthew, et al.
Published: (2005)