Jagged polynomial commitments (or: How to stack multilinears)

DOI10.1007/978-3-032-25336-1_5MaRDI QIDQ7305286zbMATH OpenFDO

Authors Tamir Hemo, Kevin Jue, Eugene Rabinovich, Gyumin Roh, Ron D. Rothblum

Publication date 29 July 2026

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Algebraic methods for interactive proof systems
• 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
• Constant-round interactive proofs for delegating computation
• Delegating computation: interactive proofs for muggles
• Delegating computations with (almost) minimal time and space overhead
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Ligero: lightweight sublinear arguments without a trusted setup
• Local proofs approaching the witness length
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Proximity gaps for Reed-Solomon codes
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• STIR: Reed-Solomon proximity testing with fewer queries
• Succinct arguments over towers of binary fields
• Unlocking the lookup singularity with \textsf{Lasso}
• WHIR: Reed-Solomon proximity testing with super-fast verification

This page was built for publication: Jagged polynomial commitments (or: How to stack multilinears)

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