Rational proofs

PD Azar, S Micali - Proceedings of the forty-fourth annual ACM …, 2012 - dl.acm.org
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 …

Super-efficient rational proofs

PD Azar, S Micali - Proceedings of the fourteenth ACM conference on …, 2013 - dl.acm.org
Information asymmetry is a central problem in both computer science and economics. In
many fundamental problems, an uninformed principal wants to obtain some knowledge from …

Rational proofs with multiple provers

J Chen, S McCauley, S Singh - … of the 2016 ACM Conference on …, 2016 - dl.acm.org
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 …

Relativized arthur-merlin versus merlin-arthur games

M Santha - Information and Computation, 1989 - Elsevier
Arthur-Merlin games were introduced recently by Babai in order to capture the intuitive
notion of efficient, probabilistic proof systems. Considered as complexity classes, they are …

Sequentially composable rational proofs

M Campanelli, R Gennaro - Decision and Game Theory for Security: 6th …, 2015 - Springer
Abstract We show that Rational Proofs do not satisfy basic compositional properties in the
case where a large number of “computation problems” are outsourced. We show that a “fast” …

An efficient parallel repetition theorem for Arthur-Merlin games

R Pass, M Venkitasubramaniam - Proceedings of the thirty-ninth annual …, 2007 - dl.acm.org
We show a parallel-repetition theorem for constant-round Arthur-Merlin Games, using an
efficient reduction. As a consequence, we show that parallel repetition reduces the …

[PDF][PDF] Two prover protocols: low error at affordable rates

U Feige, J Kilian - Proceedings of the twenty-sixth annual ACM …, 1994 - dl.acm.org
We consider single-round two prover proof systems, as introduced by Ben-Or et ai.[9]. In
these proof systems, V generates a pair of questions(ql, qz) based on the input z and his …

Rational proofs against rational verifiers

K Inasawa, K Yasunaga - IEICE Transactions on Fundamentals of …, 2017 - search.ieice.org
Rational proofs, introduced by Azar and Micali (STOC 2012), are a variant of interactive
proofs in which the prover is rational, and may deviate from the protocol for increasing his …

Interactive proof systems: Provers that never fail and random selection

O Goldreich, Y Mansour… - 28th Annual Symposium on …, 1987 - ieeexplore.ieee.org
An interactive proof system with Perfect Completeness (resp. Perfect Soundness) for a
language L is an interactive proof (for L) in which for every x∈ L (resp. x∉ L) the verifier …

[PS][PS] Alternative models for zero knowledge interactive proofs

U Feige - 1990 - wisdom.weizmann.ac.il
An interactive proof system is a procedure by which a computational unlimited (but
untrusted) prover can convince a polynomial time veri er of the validity of some complex …