Plonk is simulation extractable in ROM under falsifiable assumptions

DOI10.1007/978-3-032-12290-2_1MaRDI QIDQ7233223zbMATH OpenFDO

Authors Helger Lipmaa

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12290-2_1

zbMATH Keywords

Fiat-ShamirPlonksimulation extractabilitytrapdoorless zero-knowledgeunique responsezk-SNARK

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A unified framework for non-universal SNARKs
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Algebraic group model with oblivious sampling
• Another look at extraction and randomization of Groth's zk-SNARK
• Constant-Size Commitments to Polynomials and Their Applications
• Constant-size zk-SNARKs in ROM from falsifiable assumptions
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
• Fiat-Shamir transformation of multi-round interactive proofs
• From polynomial IOP and commitments to non-malleable zkSNARKs
• How (not) to simulate PLONK
• How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
• How to prove false statements: practical attacks on Fiat-Shamir
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1842511 (Why is no real title available?)
• Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On knowledge-soundness of Plonk in ROM from falsifiable assumptions
• On the Non-malleability of the Fiat-Shamir Transform
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Short pairing-based non-interactive zero-knowledge arguments
• Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Spartan and bulletproofs are simulation-extractable (for free!)
• Succinct NP Proofs from an Extractability Assumption
• The algebraic group model and its applications
• To label, or not to label (in generic groups)
• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
• Witness-succinct universally-composable SNARKs

Cited in

(3)

• Fully-adaptive two-round threshold Schnorr signatures from DDH
• Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments
• The art of linearization: from a KZG's trick to a general commitment framework

This page was built for publication: Plonk is simulation extractable in ROM under falsifiable assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233223)