How (not) to simulate PLONK

DOI10.1007/978-3-031-71070-4_5MaRDI QIDQ6660383zbMATH OpenFDO

Authors Marek Sefranek

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71070-4_5

zbMATH Keywords

simulatorvulnerabilityzero knowledgezk-SNARKs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Simulation Extractable Versions of Groth’s zk-SNARK Revisited
• Transparent SNARKs from DARK compilers
• Constant-size zk-SNARKs in ROM from falsifiable assumptions

Cites work

• Constant-Size Commitments to Polynomials and Their Applications
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On the size of pairing-based non-interactive arguments
• The knowledge complexity of interactive proof-systems

Cited in

(3)

• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• On knowledge-soundness of Plonk in ROM from falsifiable assumptions
• Plonk is simulation extractable in ROM under falsifiable assumptions

This page was built for publication: How (not) to simulate PLONK

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