Query-optimal IOPPs for linear-time encodable codes

DOI10.1007/978-3-032-25336-1_4MaRDI QIDQ7305284zbMATH OpenFDO

Authors Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Matan Shtepel

Publication date 29 July 2026

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

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
• Fast Reed-Solomon interactive oracle proofs of proximity
• Field-agnostic SNARKs from expand-accumulate codes
• scientific article; zbMATH DE number 7650353 (Why is no real title available?)
• Interactive oracle proofs
• Linear-size constant-query IOPs for delegating computation
• Linear-time arguments with sublinear verification from tensor codes
• Local proofs approaching the witness length
• Proving as fast as computing: succinct arguments with constant prover overhead
• Proximity gaps for Reed-Solomon codes
• STIR: Reed-Solomon proximity testing with fewer queries
• WHIR: Reed-Solomon proximity testing with super-fast verification
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier

Cited in

(1)

• How to prove post-quantum security for succinct non-interactive reductions

This page was built for publication: Query-optimal IOPPs for linear-time encodable codes

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