Spartan and bulletproofs are simulation-extractable (for free!)
From MaRDI portal
Publication:6061373
Recommendations
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
- Simulation Extractable Versions of Groth’s zk-SNARK Revisited
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Witness-succinct universally-composable SNARKs
Cites work
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Advances in Cryptology - CRYPTO 2003
- Another look at extraction and randomization of Groth's zk-SNARK
- Aurora: transparent succinct arguments for R1CS
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Fiat-Shamir transformation of multi-round interactive proofs
- How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Interactive oracle proofs
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- New and improved constructions of non-malleable cryptographic protocols
- Non-malleable zero knowledge: black-box constructions and definitional relationships
- Nova: recursive zero-knowledge arguments from folding schemes
- On Signatures of Knowledge
- On the Non-malleability of the Fiat-Shamir Transform
- On the size of pairing-based non-interactive arguments
- On tight security proofs for Schnorr signatures
- Orion: zero knowledge proof with linear prover time
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Simulation Extractable Versions of Groth’s zk-SNARK Revisited
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- The algebraic group model and its applications
- The knowledge complexity of interactive proof-systems
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Tight state-restoration soundness in the algebraic group model
- Transparent SNARKs from DARK compilers
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Zero knowledge in the random oracle model, revisited
Cited in
(15)- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
- From polynomial IOP and commitments to non-malleable zkSNARKs
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
- Polymath: Groth16 is not the limit
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- Universally composable SNARKs with transparent setup without programmable random oracle
- SNARKs for virtual machines are non-malleable
- Universal adaptor signatures from blackbox multi-party computation
- Plonk is simulation extractable in ROM under falsifiable assumptions
- Fully-adaptive two-round threshold Schnorr signatures from DDH
- Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments
- On quantum simulation-soundness
- On the simulation-extractability of proof-carrying data
This page was built for publication: Spartan and bulletproofs are simulation-extractable (for free!)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6061373)
