Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
From MaRDI portal
Publication:6635764
DOI10.1007/978-3-031-57722-2_3MaRDI QIDQ6635764
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Gemini: elastic SNARKs for diverse environments
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Algebraic methods for interactive proof systems
- Signatures of Correct Computation
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- On the Size of Pairing-Based Non-interactive Arguments
- Witness-succinct universally-composable SNARKs
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Spartan and bulletproofs are simulation-extractable (for free!)
- Simulation Extractable Versions of Groth’s zk-SNARK Revisited
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
This page was built for publication: Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
