Marlin: preprocessing zkSNARKs with universal and updatable SRS
From MaRDI portal
Publication:2055641
DOI10.1007/978-3-030-45721-1_26OpenAlexW2982474429MaRDI QIDQ2055641FDOQ2055641
Authors: Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, Nicholas Ward 
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_26
Recommendations
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Updatable and universal common reference strings with applications to zk-SNARKs
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Cites Work
- Short PCPs with Polylog Query Complexity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Short pairing-based non-interactive zero-knowledge arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Title not available (Why is that?)
- Signatures of correct computation
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Delegating computation: interactive proofs for muggles
- Constant-round interactive proofs for delegating computation
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Lattice-based SNARGs and their application to more efficient obfuscation
- On the size of pairing-based non-interactive arguments
- Interactive oracle proofs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Scalable zero knowledge via cycles of elliptic curves
- Constant-Size Commitments to Polynomials and Their Applications
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Linear-size constant-query IOPs for delegating computation
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Computational integrity with a public random string from quasi-linear PCPs
Cited In (only showing first 100 items - show all)
- NIWI and new notions of extraction for algebraic languages
- Updatable NIZKs from non-interactive zaps
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- 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
- Proof-carrying data without succinct arguments
- Time- and space-efficient arguments from groups of unknown order
- Snarky ceremonies
- Plumo: an ultralight blockchain client
- Tight state-restoration soundness in the algebraic group model
- Private polynomial commitments and applications to MPC
- Title not available (Why is that?)
- Proofs for inner pairing products and applications
- Flexible and efficient verifiable computation on encrypted data
- Rinocchio: SNARKs for ring arithmetic
- Composition with knowledge assumptions
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Spartan and bulletproofs are simulation-extractable (for free!)
- Witness-succinct universally-composable SNARKs
- Polynomial IOPs for linear algebra relations
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Algebraic adversaries in the universal composability framework
- Nova: recursive zero-knowledge arguments from folding schemes
- Orion: zero knowledge proof with linear prover time
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Sumcheck arguments and their applications
- Succinct vector, polynomial, and functional commitments from lattices
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- A survey of elliptic curves for proof systems
- Short-lived zero-knowledge proofs and signatures
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Families of SNARK-friendly 2-chains of elliptic curves
- Gemini: elastic SNARKs for diverse environments
- On succinct non-interactive arguments in relativized worlds
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Transparent SNARKs from DARK compilers
- Mining for privacy: how to bootstrap a snarky blockchain
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- A PCP theorem for interactive proofs and applications
- Marlin
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- NIZK from SNARGs
- Succinct functional commitment for a large class of arithmetic circuits
- Lower bound on SNARGs in the random oracle model
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Efficient transparent polynomial commitments for zk-SNARKs
- A simple and efficient framework of proof systems for NP
- On black-box knowledge-sound commit-and-prove SNARKs
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Sigma protocols from verifiable secret sharing and their applications
- Proof of necessary work: succinct state verification with fairness guarantees
- Distributed-prover interactive proofs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Impossibilities in succinct arguments: black-box extraction and more
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Non-interactive zero-knowledge from non-interactive batch arguments
- 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
- Benchmarking the setup of updatable zk-SNARKs
- Folding schemes with selective verification
- Algebraic reductions of knowledge
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Efficient KZG-based univariate sum-check and lookup argument
- Concurrently secure blind Schnorr signatures
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- A holistic security analysis of Monero transactions
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Witness semantic security
- Unlocking the lookup singularity with \textsf{Lasso}
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Sometimes you can't distribute random-oracle-based proofs
- An efficient ZK compiler from SIMD circuits to general circuits
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Greyhound: fast polynomial commitments from lattices
- 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
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- How (not) to simulate PLONK
- Zero-knowledge IOPs approaching witness length
This page was built for publication: Marlin: preprocessing zkSNARKs with universal and updatable SRS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055641)
