Spartan: efficient and general-purpose zkSNARKs without trusted setup
From MaRDI portal
Publication:2104239
DOI10.1007/978-3-030-56877-1_25zbMath1504.94185OpenAlexW2954625838MaRDI QIDQ2104239
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_25
Related Items (41)
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Sumcheck arguments and their applications ⋮ An algebraic framework for universal and updatable SNARKs ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Gemini: elastic SNARKs for diverse environments ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Private polynomial commitments and applications to MPC ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Short-lived zero-knowledge proofs and signatures ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds) ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Proofs for inner pairing products and applications ⋮ Lower bound on SNARGs in the random oracle model ⋮ Orion: zero knowledge proof with linear prover time ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Algebraic reductions of knowledge ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Unnamed Item ⋮ Spartan ⋮ 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 ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
Uses Software
Cites Work
- Pinocchio
- Updatable and universal common reference strings with applications to zk-SNARKs
- Checking the correctness of memories
- Minimum disclosure proofs of knowledge
- Addendum to: Non-deterministic exponential time has two-prower interactive protocols
- Transparent SNARKs from DARK compilers
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Aurora: transparent succinct arguments for R1CS
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Practical verified computation with streaming interactive proofs
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Time-Optimal Interactive Proofs for Circuit Evaluation
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Proof verification and the hardness of approximation problems
- Interactive Oracle Proofs
- Decaf: Eliminating Cofactors Through Point Compression
- Simple PCPs with poly-log rate and query complexity
- How Efficient Can Memory Checking Be?
- Short PCPs with Polylog Query Complexity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Probabilistic checking of proofs
- Algebraic methods for interactive proof systems
- Interactive proofs and the hardness of approximating cliques
- Signatures of Correct Computation
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Constant-round interactive proofs for delegating computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On the concrete efficiency of probabilistically-checkable proofs
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- The PCP theorem by gap amplification
- Advances in Cryptology - ASIACRYPT 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Spartan: efficient and general-purpose zkSNARKs without trusted setup
