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 …

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 …

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 …

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 …

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

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 …

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 …

The increasing ubiquity of the cloud computing paradigm has renewed focus on the
classical problem of allowing weak clients to check the results of computation delegated to …

We explore the power of interactive proofs with a distributed verifier. In this setting, the
verifier consists of n nodes and a graph G that defines their communication pattern. The …