BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
From MaRDI portal
Recommendations
- Field-agnostic SNARKs from expand-accumulate codes
- Efficient transparent polynomial commitments for zk-SNARKs
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
Cites work
- Algebraic methods for interactive proof systems
- Constant-round interactive proofs for delegating computation
- Constant-Size Commitments to Polynomials and Their Applications
- Delegating computation: interactive proofs for muggles
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Efficiently List-Decodable Punctured Reed-Muller Codes
- Fast Reed-Solomon interactive oracle proofs of proximity
- Gemini: elastic SNARKs for diverse environments
- scientific article; zbMATH DE number 7250164 (Why is no real title available?)
- scientific article; zbMATH DE number 7650353 (Why is no real title available?)
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Interactive oracle proofs
- Interactive oracle proofs of proximity to algebraic geometry codes
- Linear-time arguments with sublinear verification from tensor codes
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Orion: zero knowledge proof with linear prover time
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Signatures of correct computation
- Transparent SNARKs from DARK compilers
Cited in
(19)- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Folding schemes with selective verification
- Field-agnostic SNARKs from expand-accumulate codes
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- WHIR: Reed-Solomon proximity testing with super-fast verification
- Blaze: fast SNARKs from interleaved RAA codes
- Transparent SNARKs over Galois rings
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- Faster proofs and VRFs from isogenies
- BrakingBase -- a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme
- Linear-time accumulation schemes
- SNARK lower bounds via communication complexity
- Quantum rewinding for IOP-based succinct arguments
- Polylogarithmic proofs for multilinears over binary towers
- Query-optimal IOPPs for linear-time encodable codes
- Jagged polynomial commitments (or: How to stack multilinears)
- \textsc{Dynark}: making Groth16 dynamic
- Hash-based multi-signatures for post-quantum Ethereum
- A divide-and-conquer sumcheck protocol
This page was built for publication: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660296)
