\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
From MaRDI portal
Publication:2120097
DOI10.1007/978-3-030-84242-0_23zbMath1485.94061OpenAlexW3192802957MaRDI QIDQ2120097
Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_23
Related Items (10)
ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Proof-carrying data from arithmetized random oracles ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ A survey of elliptic curves for proof systems ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ PointProofs, revisited ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Algebraic reductions of knowledge
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Checking the correctness of memories
- Generating random elements in finite groups.
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Recursive proof composition from accumulation schemes
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How to Prove Knowledge of Small Secrets
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Security Proofs for Signature Schemes
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Collision-Free Hashing from Lattice Problems
- Interactive Oracle Proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the Evaluation of Powers and Monomials
- A Pseudorandom Generator from any One-way Function
- On the Composition of Zero-Knowledge Proof Systems
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Fiat-Shamir: from practice to theory
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
