Updatable and universal common reference strings with applications to zk-SNARKs

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

(59)

Secure multiparty computation with identifiable abort via vindicating release
Distributed broadcast encryption from bilinear groups
\textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
Benchmarking the setup of updatable zk-SNARKs
Concurrently secure blind Schnorr signatures
Time-lock puzzles with efficient batch solving
Constant-size zk-SNARKs in ROM from falsifiable assumptions
Witness semantic security
Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
Succinct verification of compressed sigma protocols in the updatable SRS setting
Polymath: Groth16 is not the limit
Election control through social influence with unknown preferences
Updatable signatures and message authentication codes
Composition with knowledge assumptions
Additive-homomorphic functional commitments and applications to homomorphic signatures
Mining for privacy: how to bootstrap a snarky blockchain
Publicly verifiable zero knowledge from (collapsing) blockchains
A survey of elliptic curves for proof systems
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
Updateable Inner Product Argument with Logarithmic Verifier and Applications
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
An algebraic framework for universal and updatable SNARKs
Aggregatable distributed key generation
On subversion-resistant SNARKs
Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
Towards accountability in CRS generation
From polynomial IOP and commitments to non-malleable zkSNARKs
Multi-party revocation in sovrin: performance through distributed trust
\(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
Snarky ceremonies
UC-secure CRS generation for SNARKs
Orion: zero knowledge proof with linear prover time
Marlin: preprocessing zkSNARKs with universal and updatable SRS
Key-and-argument-updatable QA-NIZKs
A non-PCP approach to succinct quantum-safe zero-knowledge
Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
Witness-succinct universally-composable SNARKs
\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Spartan: efficient and general-purpose zkSNARKs without trusted setup
CRS-updatable asymmetric quasi-adaptive NIZK arguments
Counting vampires: from univariate sumcheck to updatable ZK-SNARK
Inner product functional commitments with constant-size public parameters and openings
Pairings in rank-1 constraint systems
A unified framework for non-universal SNARKs
BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
Obtaining simulation extractable NIZKs in the updatable CRS model generically
Proofs for inner pairing products and applications
Linear-map vector commitments and their practical applications
Acyclicity programming for sigma-protocols
On black-box knowledge-sound commit-and-prove SNARKs
Updatable NIZKs from non-interactive zaps
Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
On succinct non-interactive arguments in relativized worlds

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)