Updatable and universal common reference strings with applications to zk-SNARKs
From MaRDI portal
(Redirected from Publication:776013)
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)- Multi-party revocation in sovrin: performance through distributed trust
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- A unified framework for non-universal SNARKs
- Updatable NIZKs from non-interactive zaps
- On black-box knowledge-sound commit-and-prove SNARKs
- 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
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
- Snarky ceremonies
- From polynomial IOP and commitments to non-malleable zkSNARKs
- 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
- Composition with knowledge assumptions
- Distributed broadcast encryption from bilinear groups
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Witness-succinct universally-composable SNARKs
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Orion: zero knowledge proof with linear prover time
- On subversion-resistant SNARKs
- Linear-map vector commitments and their practical applications
- A survey of elliptic curves for proof systems
- \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
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- On succinct non-interactive arguments in relativized worlds
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Towards accountability in CRS generation
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Mining for privacy: how to bootstrap a snarky blockchain
- UC-secure CRS generation for 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
- Inner product functional commitments with constant-size public parameters and openings
- Updatable signatures and message authentication codes
- Aggregatable distributed key generation
- Key-and-argument-updatable QA-NIZKs
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Secure multiparty computation with identifiable abort via vindicating release
- 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
- Polymath: Groth16 is not the limit
- Acyclicity programming for sigma-protocols
- Publicly verifiable zero knowledge from (collapsing) blockchains
- Pairings in rank-1 constraint systems
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
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)