BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes

DOI10.1007/978-3-031-68403-6_5MaRDI QIDQ6660296

Binyi Chen, Hadas Zeilberger, Ben Fisch

Publication date: 10 January 2025

zbMATH Keywords

tensor codesfast Reed Solomon interactive proof of proximity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Linear-time arguments with sublinear verification from tensor codes
• Gemini: elastic SNARKs for diverse environments
• Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
• Constant-Size Commitments to Polynomials and Their Applications
• Delegating Computation
• Interactive Oracle Proofs
• Algebraic methods for interactive proof systems
• Signatures of Correct Computation
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity
• Efficiently List-Decodable Punctured Reed-Muller Codes
• Constant-round interactive proofs for delegating computation
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Orion: zero knowledge proof with linear prover time
• Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
• Interactive oracle proofs of proximity to algebraic geometry codes

This page was built for publication: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes