Constant-round interactive proofs for delegating computation

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 the validity of extremely complicated statements (as long as they can be evaluated using polynomial space). The interactive proof system designed for this purpose requires a polynomial number of communication rounds and an exponential-time (polynomial-space complete) prover. In this paper, we study the power of more efficient interactive proof systems.

Authors

• Omer Reingold
• Guy N. Rothblum
• Ron D. Rothblum

Keywords

• Delegation
• Verifiable Computation
• Interactive Proofs