Updatable and universal common reference strings with applications to zk-SNARKs
From MaRDI portal
Publication:776013
DOI10.1007/978-3-319-96878-0_24zbMATH Open1457.94137OpenAlexW2884599530MaRDI QIDQ776013FDOQ776013
Authors: Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers 
Publication date: 30 June 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-96878-0_24
Recommendations
- UC-secure CRS generation for SNARKs
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Key-and-argument-updatable QA-NIZKs
Cited In (57)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
- Multi-party revocation in sovrin: performance through distributed trust
- On black-box knowledge-sound commit-and-prove SNARKs
- Updatable NIZKs from non-interactive zaps
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
- 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
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Snarky ceremonies
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Election control through social influence with unknown preferences
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Proofs for inner pairing products and applications
- Distributed broadcast encryption from bilinear groups
- Composition with knowledge assumptions
- Witness-succinct universally-composable SNARKs
- 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
- Orion: zero knowledge proof with linear prover time
- Linear-map vector commitments and their practical applications
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- A survey of elliptic curves for proof systems
- On subversion-resistant SNARKs
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Benchmarking the setup of updatable zk-SNARKs
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- On succinct non-interactive arguments in relativized worlds
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Inner product functional commitments with constant-size public parameters and openings
- Mining for privacy: how to bootstrap a snarky blockchain
- A Unified Framework for Non-universal SNARKs
- Updatable signatures and message authentication codes
- Aggregatable distributed key generation
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- Key-and-argument-updatable QA-NIZKs
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
- Pairings in rank-1 constraint systems
- Acyclicity programming for sigma-protocols
- Publicly verifiable zero knowledge from (collapsing) blockchains
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Concurrently secure blind Schnorr signatures
- Time-lock puzzles with efficient batch solving
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Witness semantic security
- Secure multiparty computation with identifiable abort via vindicating release
- Polymath: Groth16 is not the limit
This page was built for publication: Updatable and universal common reference strings with applications to zk-SNARKs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776013)
