Nova: recursive zero-knowledge arguments from folding schemes
From MaRDI portal
Publication:6166957
Recommendations
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Algebraic methods for interactive proof systems
- Constant-round interactive proofs for delegating computation
- Constant-Size Commitments to Polynomials and Their Applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient verifiable delay functions
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the size of pairing-based non-interactive arguments
- Proof-carrying data without succinct arguments
- Proofs for inner pairing products and applications
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- Scalable zero knowledge via cycles of elliptic curves
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- The knowledge complexity of interactive proof-systems
- Time-optimal interactive proofs for circuit evaluation
- Transparent SNARKs from DARK compilers
- Verifiable delay functions
Cited in
(42)- Proof-carrying data from arithmetized random oracles
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- Spartan and bulletproofs are simulation-extractable (for free!)
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Algebraic reductions of knowledge
- Protostar: generic efficient accumulation/folding for special-sound protocols
- Folding schemes with selective verification
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Unlocking the lookup singularity with \textsf{Lasso}
- Cryptanalysis of algebraic verifiable delay functions
- On sequential functions and fine-grained cryptography
- An efficient ZK compiler from SIMD circuits to general circuits
- Mangrove: a scalable framework for folding-based SNARKs
- HyperNova: recursive arguments for customizable constraint systems
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Succinct non-subsequence arguments
- BOIL: proof-carrying data from accumulation of correlated holographic IOPs
- Incrementally verifiable computation for NP from standard assumptions
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Zero-knowledge RAM: doubly efficient and black-box
- SNARKs for virtual machines are non-malleable
- Split prover zero-knowledge SNARKs
- Security bounds for proof-carrying data from straightline extractors
- FLI: folding lookup instances
- Proofs for deep thought: accumulation for large memories and deterministic computations
- MuxProofs: succinct arguments for machine computation from vector lookups
- Lova: lattice-based folding scheme from unstructured lattices
- \textit{Ceno}: non-uniform, segment and parallel zero-knowledge virtual machine
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- BrakingBase -- a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme
- \textsf{FREPack}: improved SNARK frontend for highly repetitive computations
- IVC in the open-and-sign random oracle model
- How to prove post-quantum security for succinct non-interactive reductions
- On the use of Atkin and Weber modular polynomials in isogeny proofs of knowledge
- Folding schemes with privacy preserving selective verification
- Ba\textit{loo}: algebraic lookup arguments
- Interstellar: efficient GKR-based IVC scheme with privacy-preserving collaborative folding
- On composing AGM-secure functionalities with cryptographic proofs. Applications to unbounded-depth IVC and more
- On the simulation-extractability of proof-carrying data
This page was built for publication: Nova: recursive zero-knowledge arguments from folding schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166957)
