Succinct arguments over towers of binary fields

DOI10.1007/978-3-031-91134-7_4MaRDI QIDQ6891326zbMATH OpenFDO

Authors Benjamin E. Diamond, Jim Posen

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91134-7_4

zbMATH Keywords

binary fieldserror-correcting codessuccinct arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Algebraic methods for interactive proof systems
• Algorithmic Results in List Decoding
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Constant-Size Commitments to Polynomials and Their Applications
• Delegating computation: interactive proofs for muggles
• Fast Reed-Solomon interactive oracle proofs of proximity
• scientific article; zbMATH DE number 4075228 (Why is no real title available?)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Ligero: lightweight sublinear arguments without a trusted setup
• Linear-time arguments with sublinear verification from tensor codes
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Novel polynomial basis and its application to Reed-Solomon erasure codes
• Proximity gaps for Reed-Solomon codes
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• The explicit construction of irreducible polynomials over finite fields
• Transparent SNARKs from DARK compilers
• Unlocking the lookup singularity with \textsf{Lasso}

Cited in

(4)

• Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
• Polylogarithmic proofs for multilinears over binary towers
• Jagged polynomial commitments (or: How to stack multilinears)
• Ba\textit{loo}: algebraic lookup arguments

This page was built for publication: Succinct arguments over towers of binary fields

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