HyperPlonk: Plonk with linear-time prover and high-degree custom gates
From MaRDI portal
Publication:6061371
DOI10.1007/978-3-031-30617-4_17OpenAlexW4365808257MaRDI QIDQ6061371
Zhenfei Zhang, Dan Boneh, Binyi Chen, Benedikt Bünz
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_17
Related Items (2)
Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Non-interactive zero-knowledge from non-interactive batch arguments
Cites Work
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Linear-time arguments with sublinear verification from tensor codes
- Gemini: elastic SNARKs for diverse environments
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Constant-Size Commitments to Polynomials and Their Applications
- Interactive Oracle Proofs
- Short PCPs with Polylog Query Complexity
- The Knowledge Complexity of Interactive Proof Systems
- Algebraic methods for interactive proof systems
- Signatures of Correct Computation
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
- On the Size of Pairing-Based Non-interactive Arguments
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Orion: zero knowledge proof with linear prover time
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
This page was built for publication: HyperPlonk: Plonk with linear-time prover and high-degree custom gates
