Linear-size constant-query IOPs for delegating computation
From MaRDI portal
Publication:2175951
DOI10.1007/978-3-030-36033-7_19zbMath1455.94123OpenAlexW2991000045MaRDI QIDQ2175951
Michael Riabzev, Eli Ben-Sasson, Tom Gur, Lior Goldberg, Nicholas Spooner, Alessandro Chiesa
Publication date: 30 April 2020
Full work available at URL: http://wrap.warwick.ac.uk/128408/1/WRAP-linear-size-constant-query-IOPs-delegating-computation-Gur-2019.pdf
Related Items (15)
Sumcheck arguments and their applications ⋮ Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs ⋮ A PCP theorem for interactive proofs and applications ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Parallelizable delegation from LWE ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Lattice-based timed cryptography ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero knowledge protocols from succinct constraint detection
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
- Nearly-linear size holographic proofs
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Arithmetic Circuits: A survey of recent results and open questions
- Linear-time encodable and decodable error-correcting codes
- Proof verification and the hardness of approximation problems
- Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
- Interactive Oracle Proofs
- Interactive PCP
- Locally testable codes and PCPs of almost-linear length
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Short PCPs with Polylog Query Complexity
- The Knowledge Complexity of Interactive Proof Systems
- Probabilistic checking of proofs
- Simple Constructions of Almost k-wise Independent Random Variables
- Designing programs that check their work
- Interactive proofs and the hardness of approximating cliques
- Computationally Sound Proofs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Constant-round interactive proofs for delegating computation
- On the concrete efficiency of probabilistically-checkable proofs
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- The PCP theorem by gap amplification
- Small PCPs with low query complexity
This page was built for publication: Linear-size constant-query IOPs for delegating computation
