HyperPlonk: Plonk with linear-time prover and high-degree custom gates
From MaRDI portal
Publication:6061371
Recommendations
- How (not) to simulate PLONK
- Transparent SNARKs from DARK compilers
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Algebraic methods for interactive proof systems
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Aurora: transparent succinct arguments for R1CS
- Constant-Size Commitments to Polynomials and Their Applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Fast Reed-Solomon interactive oracle proofs of proximity
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Gemini: elastic SNARKs for diverse environments
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the size of pairing-based non-interactive arguments
- Orion: zero knowledge proof with linear prover time
- Polynomial multiplication over finite fields in time O(n n)
- Quadratic span programs and succinct NIZKs without PCPs
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Scalable zero knowledge with no trusted setup
- Short PCPs with Polylog Query Complexity
- Signatures of correct computation
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct non-interactive arguments via linear interactive proofs
- The Knowledge Complexity of Interactive Proof Systems
- Time-optimal interactive proofs for circuit evaluation
- Transparent SNARKs from DARK compilers
Cited in
(54)- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Non-interactive zero-knowledge from non-interactive batch arguments
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Concurrently secure blind Schnorr signatures
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Unlocking the lookup singularity with \textsf{Lasso}
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- An efficient ZK compiler from SIMD circuits to general circuits
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Mangrove: a scalable framework for folding-based SNARKs
- HyperNova: recursive arguments for customizable constraint systems
- How to prove statements obliviously?
- Succinct non-subsequence arguments
- How (not) to simulate PLONK
- BOIL: proof-carrying data from accumulation of correlated holographic IOPs
- Verifiable computation for approximate homomorphic encryption schemes
- Malicious security in collaborative zk-SNARKs: more than meets the eye
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Straight-line knowledge extraction for multi-round protocols
- Foundations of platform-assisted auctions
- On extractability of the KZG family of polynomial commitment schemes
- DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
- \textsf{Polocolo}: a ZK-friendly hash function based on S-boxes using power residues
- WHIR: Reed-Solomon proximity testing with super-fast verification
- Blaze: fast SNARKs from interleaved RAA codes
- Succinct arguments over towers of binary fields
- Permutation argument via bases transformation
- zk-SNARK for blockchain developers
- Single-input functionality against a dishonest majority: practical and round-optimal
- Transparent SNARKs over Galois rings
- Jackpot: non-interactive aggregatable lotteries
- MuxProofs: succinct arguments for machine computation from vector lookups
- \textit{Ceno}: non-uniform, segment and parallel zero-knowledge virtual machine
- Natively compatible super-efficient lookup arguments and how to apply them
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- A crack in the firmament: restoring soundness of the Orion proof system and more
- BrakingBase -- a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- Quantum rewinding for IOP-based succinct arguments
- Time-space trade-offs for sumcheck
- Polylogarithmic proofs for multilinears over binary towers
- Soloist: distributed snark for R1CS with constant proof size
- Jagged polynomial commitments (or: How to stack multilinears)
- Dynamic zk-SNARKs (with applications to sparse zk-SNARKs and IVC)
- \textsf{Boomy}: batch opening of multivariate polynomial commitment
- Simple attacks against (extended) Fiat-Shamir
- zkMaP: zero-knowledge succinct non-interactive matrix multiplication proofs
- General techniques for building SNARKs over the integers
- Succinctly verifiable computation over additively-homomorphically encrypted data: making privacy-preserving blueprints practical
- FRIttata: a FRI-based polynomial commitment scheme for distributed proof generation
This page was built for publication: HyperPlonk: Plonk with linear-time prover and high-degree custom gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6061371)
