Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
From MaRDI portal
Publication:2170049
DOI10.1007/978-3-031-07085-3_10zbMath1496.94028OpenAlexW3214484754MaRDI QIDQ2170049
Si-Qi Liu, Jonathan Bootle, Alessandro Chiesa
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_10
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
Ligero: lightweight sublinear arguments without a trusted setup ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Succinct arguments for RAM programs via projection codes ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Orion: zero knowledge proof with linear prover time ⋮ A toolbox for barriers on interactive oracle proofs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial PCPs with short proofs
- On the complexity of interactive proofs with bounded communication
- Minimum disclosure proofs of knowledge
- On interactive proofs with a laconic prover
- Zero knowledge protocols from succinct constraint detection
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- How to construct constant-round zero-knowledge proof systems for NP
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Stacked garbling for disjunctive zero-knowledge proofs
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Linear-time arguments with sublinear verification from tensor codes
- Linear-size constant-query IOPs for delegating computation
- Aurora: transparent succinct arguments for R1CS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
- IP = PSPACE Using Error-Correcting Codes
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Zero Knowledge LTCs and Their Applications
- On Efficient Zero-Knowledge PCPs
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Linear-time encodable and decodable error-correcting codes
- Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
- Interactive Oracle Proofs
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Probabilistic checking of proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Constant-round interactive proofs for delegating computation
- Secure Computation from Random Error Correcting Codes
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
