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 …

Rational proofs, recently introduced by Azar and Micali (STOC 2012), are a variant of
interactive proofs in which the prover is neither honest nor malicious, but rather rational. The …

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 …

As modern computing moves towards smaller devices and powerful cloud platforms, more
and more computation is being delegated to powerful service providers. Interactive proofs …

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” …

We investigate proof systems where security holds against rational parties instead of
malicious ones. Our starting point is the notion of rational arguments, a variant of rational …

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 …

Several research teams have recently been working toward the development of practical
general-purpose protocols for verifiable computation. These protocols enable a …

The celebrated IP= PSPACE Theorem of Lund et-al.(J. ACM 1992) and Shamir (J. ACM
1992), allows an all-powerful but untrusted prover to convince a polynomial-time verifier of …

Interactive proof systems allow a resource-bounded verifier to decide an intractable
language (or compute a hard function) by communicating with a powerful but untrusted …