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 rational ones. In essen...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | en_US |
| Published: |
© Association for Computing Machinery, New York, NY, USA
2022
|
| Online Access: | https://doi.org/10.1145/2213977.2214069 https://hdl.handle.net/1721.1/141708 |