Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
From MaRDI portal
Publication:2170049
Recommendations
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Aurora: transparent succinct arguments for R1CS
- Combinatorial PCPs with short proofs
- Constant rate PCPs for circuit-SAT with sublinear query complexity
- Constant-round interactive proofs for delegating computation
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- How to construct constant-round zero-knowledge proof systems for NP
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1559565 (Why is no real title available?)
- scientific article; zbMATH DE number 7250164 (Why is no real title available?)
- Interactive locking, zero-knowledge PCPs, and unconditional cryptography
- Interactive oracle proofs
- Interactive oracle proofs with constant rate and query complexity
- IP = PSPACE using error-correcting codes
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-size constant-query IOPs for delegating computation
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time encodable and decodable error-correcting codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Low-complexity cryptographic hash functions
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Minimum disclosure proofs of knowledge
- On Efficient Zero-Knowledge PCPs
- On interactive proofs with a laconic prover
- On the complexity of interactive proofs with bounded communication
- Probabilistic checking of proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Secure Computation from Random Error Correcting Codes
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Stacked garbling for disjunctive zero-knowledge proofs
- Succinct non-interactive arguments via linear interactive proofs
- The Knowledge Complexity of Interactive Proof Systems
- Time-optimal interactive proofs for circuit evaluation
- Zero knowledge LTCs and their applications
- Zero knowledge protocols from succinct constraint detection
Cited in
(25)- Linear-time arguments with sublinear verification from tensor codes
- Linear-size constant-query IOPs for delegating computation
- Interactive oracle proofs
- Polynomial IOPs for linear algebra relations
- 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
- Generalized fuzzy password-authenticated key exchange from error correcting codes
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Zero-knowledge IOPs approaching witness length
- Field-agnostic SNARKs from expand-accumulate codes
- How to prove statements obliviously?
- Split prover zero-knowledge SNARKs
- Hamming weight proofs of proximity with one-sided error
- Interactive line-point zero-knowledge with sublinear communication and linear computation
- Local proofs approaching the witness length
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- A crack in the firmament: restoring soundness of the Orion proof system and more
- Linear-time accumulation schemes
- Query-optimal IOPPs for linear-time encodable codes
This page was built for publication: Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170049)
