Linear-Size Constant-Query IOPs for Delegating Computation

Eli Ben-Sasson,Nicholas Spooner,Tom Gur,Lior Goldberg,Alessandro Chiesa,Michael Riabzev

doi:10.1007/978-3-030-36033-7_19

Linear-Size Constant-Query IOPs for Delegating Computation

Eli Ben-Sasson, Nicholas Spooner + Show 4 more

Open Access

https://doi.org/10.1007/978-3-030-36033-7_19

Copy DOI

Publication Date: Jan 1, 2019

Citations: 20

Affiliation: BSD Crown (Israel), Berkeley College, University of California, Berkeley, University of Warwick

#Interactive Proofs #Succinct Non-interactive Arguments + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We study the problem of delegating computations via interactive proofs that can be probabilistically checked. Known as interactive oracle proofs (IOPs), these proofs extend probabilistically checkable proofs (PCPs) to multi-round protocols, and have received much attention due to their application to constructing cryptographic proofs (such as succinct non-interactive arguments). The relevant complexity measures for IOPs in this context are prover and verifier time, and query complexity.

Full Text