What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
From MaRDI portal
Publication:6134856
DOI10.1007/978-3-031-14791-3_32zbMATH Open1518.94064OpenAlexW4294768166MaRDI QIDQ6134856FDOQ6134856
Authors: Chaya Ganesh, Hamidreza Khoshakhlagh, Markulf Kohlweiss, Anca Nitulescu, Michal Zajac 
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-14791-3_32
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
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Security arguments for digital signatures and blind signatures
- Efficient public-key cryptography in the presence of key leakage
- Title not available (Why is that?)
- Minimum disclosure proofs of knowledge
- Title not available (Why is that?)
- Fully Anonymous Group Signatures Without Random Oracles
- On the Non-malleability of the Fiat-Shamir Transform
- On Signatures of Knowledge
- 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
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- On the size of pairing-based non-interactive arguments
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Interactive oracle proofs
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Scalable zero knowledge via cycles of elliptic curves
- Square span programs with applications to succinct NIZK arguments
- Constant-Size Commitments to Polynomials and Their Applications
- Advances in cryptology -- CRYPTO 2021. 41st annual international cryptology conference, CRYPTO 2021, virtual event, August 16--20, 2021. Proceedings. Part III
- Key-and-argument-updatable QA-NIZKs
- Another look at extraction and randomization of Groth's zk-SNARK
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Cited In (19)
- Fiat-Shamir security of FRI and related SNARKs
- Updatable NIZKs from non-interactive zaps
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
- An algebraic framework for universal and updatable SNARKs
- 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?
- Benchmarking the setup of updatable zk-SNARKs
- Efficient isogeny proofs using generic techniques
- Vector commitments with proofs of smallness: short range proofs and more
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- 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)
