Linear-Size Constant-Query IOPs for Delegating Computation

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

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

Linear-Size Constant-Query IOPs for Delegating Computation

Eli Ben-Sasson, Alessandro Chiesa + 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

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.