How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Another look at extraction and randomization of Groth's zk-SNARK
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Constant-Size Commitments to Polynomials and Their Applications
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- 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
- On Signatures of Knowledge
- On the Non-malleability of the Fiat-Shamir Transform
- Scalable zero knowledge with no trusted setup
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Spartan and bulletproofs are simulation-extractable (for free!)
- Strengthening zero-knowledge protocols using signatures
- Transparent SNARKs from DARK compilers
- Universally composable -protocols in the global random-oracle model
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Witness-succinct universally-composable SNARKs
- Zether: towards privacy in a smart contract world
Cited in
(7)- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Universally composable SNARKs with transparent setup without programmable random oracle
- SNARKs for virtual machines are non-malleable
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- Plonk is simulation extractable in ROM under falsifiable assumptions
- Fully-adaptive two-round threshold Schnorr signatures from DDH
This page was built for publication: How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582228)
