Spartan and bulletproofs are simulation-extractable (for free!)
From MaRDI portal
Publication:6061373
DOI10.1007/978-3-031-30617-4_18OpenAlexW4365806553MaRDI QIDQ6061373
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_18
Cites Work
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Expected-time cryptography: generic techniques and applications to concrete soundness
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Tight state-restoration soundness in the algebraic group model
- Another look at extraction and randomization of Groth's zk-SNARK
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Aurora: transparent succinct arguments for R1CS
- On tight security proofs for Schnorr signatures
- On the Non-malleability of the Fiat-Shamir Transform
- Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
- Interactive Oracle Proofs
- New and improved constructions of non-malleable cryptographic protocols
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Zero Knowledge in the Random Oracle Model, Revisited
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The knowledge complexity of interactive proof-systems
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Advances in Cryptology - CRYPTO 2003
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- 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
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Orion: zero knowledge proof with linear prover time
- Nova: recursive zero-knowledge arguments from folding schemes
- Fiat-Shamir transformation of multi-round interactive proofs
