Polylogarithmic proofs for multilinears over binary towers

DOI10.1007/978-3-032-25336-1_1MaRDI QIDQ7305281zbMATH OpenFDO

Authors Benjamin E. Diamond, Jim Posen

Publication date 29 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25336-1_1

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
• Blaze: fast SNARKs from interleaved RAA codes
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Fast Fourier transform via automorphism groups of rational function fields
• Fast Reed-Solomon interactive oracle proofs of proximity
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Ligero: lightweight sublinear arguments without a trusted setup
• Linear-time arguments with sublinear verification from tensor codes
• Local proofs approaching the witness length
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Modern computer algebra
• Novel polynomial basis and its application to Reed-Solomon erasure codes
• Proximity gaps for Reed-Solomon codes
• Proximity testing with logarithmic randomness
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Succinct arguments over towers of binary fields
• The Normal Basis Theorem
• WHIR: Reed-Solomon proximity testing with super-fast verification

This page was built for publication: Polylogarithmic proofs for multilinears over binary towers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305281)