Simulation-extractable KZG polynomial commitments and applications to HyperPlonk

DOI10.1007/978-3-031-57722-2_3MaRDI QIDQ6635764zbMATH OpenFDO

Authors Benoît Libert

Publication date 12 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-57722-2_3

zbMATH Keywords

polynomial commitmentssimulation-extractabilitySNARKszero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Algebraic methods for interactive proof systems
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient public-key cryptography in the presence of key leakage
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
• Gemini: elastic SNARKs for diverse environments
• 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 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 1842511 (Why is no real title available?)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On the size of pairing-based non-interactive arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Scalable zero knowledge with no trusted setup
• Signatures of correct computation
• 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 and bulletproofs are simulation-extractable (for free!)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• The algebraic group model and its applications
• Time-optimal interactive proofs for circuit evaluation
• Witness-succinct universally-composable SNARKs

Cited in

(3)

• On extractability of the KZG family of polynomial commitment schemes
• Jackpot: non-interactive aggregatable lotteries
• Plonk is simulation extractable in ROM under falsifiable assumptions

This page was built for publication: Simulation-extractable KZG polynomial commitments and applications to HyperPlonk

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