Zero-knowledge IOPs approaching witness length
From MaRDI portal
Publication:6660294
DOI10.1007/978-3-031-68403-6_4MaRDI QIDQ6660294
Publication date: 10 January 2025
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial PCPs with efficient verifiers
- Infeasibility of instance compression and succinct PCPs for NP
- Non-deterministic exponential time has two-prover interactive protocols
- Definitions and properties of zero-knowledge proof systems
- Zero knowledge protocols from succinct constraint detection
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Linear-time arguments with sublinear verification from tensor codes
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
- IP = PSPACE Using Error-Correcting Codes
- Zero Knowledge LTCs and Their Applications
- Information-theoretically secure protocols and security under composition
- Proof verification and the hardness of approximation problems
- Delegating Computation
- Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
- Interactive Oracle Proofs
- Polynomial Codes Over Certain Finite Fields
- Interactive PCP
- Probabilistic checking of proofs
- Algebraic methods for interactive proof systems
- The knowledge complexity of interactive proof-systems
- Computationally Sound Proofs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- A combination of testability and decodability by tensor products
- An Upper Bound of Singleton Type for Componentwise Products of Linear Codes
- Robust locally testable codes and products of codes
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
- The PCP theorem by gap amplification
- Proving as fast as computing: succinct arguments with constant prover overhead
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Orion: zero knowledge proof with linear prover time
This page was built for publication: Zero-knowledge IOPs approaching witness length
