What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
From MaRDI portal
(Redirected from Publication:6134856)
Recommendations
- Simulation Extractable Versions of Groth’s zk-SNARK Revisited
- Another look at extraction and randomization of Groth's zk-SNARK
- How to simulate it -- a tutorial on the simulation proof technique
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Strongly simulation-extractable leakage-resilient NIZK
- Updatable and universal common reference strings with applications to zk-SNARKs
- Fiat-Shamir: from practice to theory
- Updatable NIZKs from non-interactive zaps
Cites work
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Advances in cryptology -- CRYPTO 2021. 41st annual international cryptology conference, CRYPTO 2021, virtual event, August 16--20, 2021. Proceedings. Part III
- Another look at extraction and randomization of Groth's zk-SNARK
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient public-key cryptography in the presence of key leakage
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fully Anonymous Group Signatures Without Random Oracles
- Interactive oracle proofs
- Key-and-argument-updatable QA-NIZKs
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Minimum disclosure proofs of knowledge
- On Signatures of Knowledge
- On the Non-malleability of the Fiat-Shamir Transform
- On the size of pairing-based non-interactive arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Quadratic span programs and succinct NIZKs without PCPs
- Scalable zero knowledge via cycles of elliptic curves
- Security arguments for digital signatures and blind signatures
- Short pairing-based non-interactive zero-knowledge arguments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Square span programs with applications to succinct NIZK arguments
- Succinct non-interactive arguments via linear interactive proofs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- The algebraic group model and its applications
- Updatable and universal common reference strings with applications to zk-SNARKs
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Cited in
(24)- Commit-and-prove system for vectors and applications to threshold signing
- Updatable privacy-preserving blueprints
- Updatable NIZKs from non-interactive zaps
- Fiat-Shamir security of FRI and related SNARKs
- An algebraic framework for universal and updatable SNARKs
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
- Simulation Extractable Versions of Groth’s zk-SNARK Revisited
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Another look at extraction and randomization of Groth's zk-SNARK
- Spartan and bulletproofs are simulation-extractable (for free!)
- Witness-succinct universally-composable SNARKs
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Plonk is simulation extractable in ROM under falsifiable assumptions
- Benchmarking the setup of updatable zk-SNARKs
- Efficient isogeny proofs using generic techniques
- Vector commitments with proofs of smallness: short range proofs and more
- Universally composable SNARKs with transparent setup without programmable random oracle
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- SNARKs for virtual machines are non-malleable
- How (not) to simulate PLONK
This page was built for publication: What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134856)
