What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
From MaRDI portal
Publication:6134856
DOI10.1007/978-3-031-14791-3_32zbMath1518.94064OpenAlexW4294768166MaRDI QIDQ6134856
Michał Zając, Anca Nitulescu, Chaya Ganesh, Markulf Kohlweiss, Hamidreza Khoshakhlagh
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
Related Items (6)
Witness-succinct universally-composable SNARKs ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Updatable NIZKs from non-interactive zaps ⋮ Fiat-Shamir transformation of multi-round interactive proofs
Cites Work
- Unnamed Item
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Minimum disclosure proofs of knowledge
- Security arguments for digital signatures and blind signatures
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Advances in cryptology -- CRYPTO 2021. 41st annual international cryptology conference, CRYPTO 2021, virtual event, August 16--20, 2021. Proceedings. Part III
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- 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)
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- On the Non-malleability of the Fiat-Shamir Transform
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Square Span Programs with Applications to Succinct NIZK Arguments
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Interactive Oracle Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fully Anonymous Group Signatures Without Random Oracles
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- On Signatures of Knowledge
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
This page was built for publication: What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
