\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
From MaRDI portal
Publication:2120097
Recommendations
- Proof-carrying data without succinct arguments
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- Constant-Size Commitments to Polynomials and Their Applications
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- A Pseudorandom Generator from any One-way Function
- Aurora: transparent succinct arguments for R1CS
- Checking the correctness of memories
- Collision-free hashing from lattice problems
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- From obfuscation to the security of Fiat-Shamir for proofs
- Generating random elements in finite groups.
- How to prove knowledge of small secrets
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 7650405 (Why is no real title available?)
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the Composition of Zero-Knowledge Proof Systems
- On the Evaluation of Powers and Monomials
- On the size of pairing-based non-interactive arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge with no trusted setup
- Security proofs for signature schemes
- Short pairing-based non-interactive zero-knowledge arguments
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Succinct non-interactive arguments via linear interactive proofs
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Updatable and universal common reference strings with applications to zk-SNARKs
Cited in
(37)- Proof-carrying data without succinct arguments
- \textsf{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
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Folding schemes with selective verification
- Vector commitments with proofs of smallness: short range proofs and more
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- Functional commitments for arbitrary circuits of bounded sizes
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- BOIL: proof-carrying data from accumulation of correlated holographic IOPs
- Incrementally verifiable computation for NP from standard assumptions
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- \textsc{Arc}: accumulation for Reed-Solomon codes
- On extractability of the KZG family of polynomial commitment schemes
- Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time
- The complexity of memory checking with covert security
- Security bounds for proof-carrying data from straightline extractors
- Proofs for deep thought: accumulation for large memories and deterministic computations
- MuxProofs: succinct arguments for machine computation from vector lookups
- Memory checking requires logarithmic overhead
- \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems
- Inner-product commitments over integers with applications to succinct arguments
- IVC in the open-and-sign random oracle model
- Cyclo: lightweight lattice-based folding via partial range checks
- Soloist: distributed snark for R1CS with constant proof size
- Folding schemes with privacy preserving selective verification
This page was built for publication: \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120097)
