Proximity gaps for Reed-Solomon codes

DOI10.1109/FOCS46700.2020.00088MaRDI QIDQ6943967zbMATH OpenFDO

Authors Swastik Kopparty, Yuval Ishai, Dan Carmon, Eli Ben-Sasson, Shubhangi Saraf

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00088

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Cited in

(11)

• BOIL: proof-carrying data from accumulation of correlated holographic IOPs
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Study of arithmetization methods for STARKs
• Verifiable computation for approximate homomorphic encryption schemes
• WHIR: Reed-Solomon proximity testing with super-fast verification
• Blaze: fast SNARKs from interleaved RAA codes
• Transparent SNARKs over Galois rings
• Threshold computation in the head: improved framework for post-quantum signatures and zero-knowledge arguments
• HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
• Linear-time accumulation schemes
• Non-interactive secure computation with constant communication overhead

This page was built for publication: Proximity gaps for Reed-Solomon codes

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