Spartan: efficient and general-purpose zkSNARKs without trusted setup
From MaRDI portal
Publication:2104239
Recommendations
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1302863 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Addendum to: Non-deterministic exponential time has two-prower interactive protocols
- Algebraic methods for interactive proof systems
- Aurora: transparent succinct arguments for R1CS
- Checking the correctness of memories
- Constant-Size Commitments to Polynomials and Their Applications
- Constant-round interactive proofs for delegating computation
- Decaf: eliminating cofactors through point compression
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How Efficient Can Memory Checking Be?
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Incremental multiset hash functions and their application to memory integrity checking
- Interactive oracle proofs
- Interactive proofs and the hardness of approximating cliques
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Minimum disclosure proofs of knowledge
- On the concrete efficiency of probabilistically-checkable proofs
- On the size of pairing-based non-interactive arguments
- Pinocchio
- Practical verified computation with streaming interactive proofs
- Probabilistic checking of proofs
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Proof verification and the hardness of approximation problems
- Quadratic span programs and succinct NIZKs without PCPs
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge with no trusted setup
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short PCPs with Polylog Query Complexity
- Short pairing-based non-interactive zero-knowledge arguments
- Signatures of correct computation
- Simple PCPs with poly-log rate and query complexity
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct non-interactive arguments via linear interactive proofs
- The PCP theorem by gap amplification
- Time-optimal interactive proofs for circuit evaluation
- Transparent SNARKs from DARK compilers
- Updatable and universal common reference strings with applications to zk-SNARKs
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Cited in
(73)- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Non-interactive batch arguments for NP from standard assumptions
- Private polynomial commitments and applications to MPC
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- Non-interactive zero-knowledge from non-interactive batch arguments
- Efficient transparent polynomial commitments for zk-SNARKs
- SnarkPack: practical SNARK aggregation
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An algebraic framework for universal and updatable SNARKs
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Distilling Constraints in Zero-Knowledge Protocols
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Short-lived zero-knowledge proofs and signatures
- 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)
- Nova: recursive zero-knowledge arguments from folding schemes
- Orion: zero knowledge proof with linear prover time
- Time- and space-efficient arguments from groups of unknown order
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- SPARKs: Succinct Parallelizable Arguments of Knowledge
- Non-interactive zero-knowledge proofs to multiple verifiers
- 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
- Aurora: transparent succinct arguments for R1CS
- Lower bound on SNARGs in the random oracle model
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Efficient proof of RAM programs from any public-coin zero-knowledge system
- Sumcheck arguments and their applications
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- 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
- Inner product functional commitments with constant-size public parameters and openings
- Spartan
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Proofs for inner pairing products and applications
- On interactive oracle proofs for Boolean R1CS statements
- Fiat-Shamir security of FRI and related SNARKs
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Algebraic reductions of knowledge
- Gemini: elastic SNARKs for diverse environments
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- On soundness notions for interactive oracle proofs
- Towards zero knowledge argument for double discrete logarithm with constant cost
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Efficient KZG-based univariate sum-check and lookup argument
- Concurrently secure blind Schnorr signatures
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Unlocking the lookup singularity with \textsf{Lasso}
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- eSTARK: extending STARKs with arguments
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Field-agnostic SNARKs from expand-accumulate codes
- HyperNova: recursive arguments for customizable constraint systems
- How to prove statements obliviously?
- Mangrove: a scalable framework for folding-based SNARKs
- Polymath: Groth16 is not the limit
- A simple and efficient framework of proof systems for NP
- Zero-knowledge IOPs approaching witness length
- Sigma protocols from verifiable secret sharing and their applications
- Succinct non-subsequence arguments
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
Describes a project that uses
Uses Software
This page was built for publication: Spartan: efficient and general-purpose zkSNARKs without trusted setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104239)
