Nova: recursive zero-knowledge arguments from folding schemes

Related Items (4)

Proof-carrying data from arithmetized random oracles ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Algebraic reductions of knowledge

Cites Work

Verifiable delay functions
Transparent SNARKs from DARK compilers
Marlin: preprocessing zkSNARKs with universal and updatable SRS
\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Spartan: efficient and general-purpose zkSNARKs without trusted setup
Recursive proof composition from accumulation schemes
Proof-carrying data without succinct arguments
Libra: succinct zero-knowledge proofs with optimal prover computation
Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
Time-Optimal Interactive Proofs for Circuit Evaluation
Scalable Zero Knowledge via Cycles of Elliptic Curves
Constant-Size Commitments to Polynomials and Their Applications
Interactive Oracle Proofs
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Algebraic methods for interactive proof systems
The knowledge complexity of interactive proof-systems
Quadratic Span Programs and Succinct NIZKs without PCPs
Constant-round interactive proofs for delegating computation
Separating succinct non-interactive arguments from all falsifiable assumptions
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Recursive composition and bootstrapping for SNARKS and proof-carrying data
On the Size of Pairing-Based Non-interactive Arguments
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Efficient verifiable delay functions
Proofs for inner pairing products and applications

This page was built for publication: Nova: recursive zero-knowledge arguments from folding schemes