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 …

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 present new protocols for the verification of space bounded polytime computations
against a rational adversary. For such computations requiring sublinear space our protocol …

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

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

We consider complexity of perfect zero-knowledge arguments [4]. Let T denote the time
needed to (deterministically) check a proof and let L denote an appropriate security …

Succinct non-interactive arguments (SNARGs) enable proofs of NP statements with very low
communication. Recently, there has been significant work in both theory and practice on …

We introduce an intriguing new type of argument systems with the additional property of
being explainable. Intuitively by explainable, we mean that given any argument under a …