STIR: Reed-Solomon proximity testing with fewer queries

DOI10.1007/978-3-031-68403-6_12MaRDI QIDQ6660306

Eylon Yogev, Giacomo Fenzi, Gal Arnon, Alessandro Chiesa

Publication date: 10 January 2025

zbMATH Keywords

interactive oracle proofsReed-Solomon proximity testing

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60)

Cites Work

• Unnamed Item
• Aurora: transparent succinct arguments for R1CS
• Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
• Proof verification and the hardness of approximation problems
• Interactive Oracle Proofs
• Polynomial Codes Over Certain Finite Fields
• Interactive PCP
• Short PCPs with Polylog Query Complexity
• The Knowledge Complexity of Interactive Proof Systems
• Probabilistic checking of proofs
• Interactive proofs and the hardness of approximating cliques
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity
• Constant-round interactive proofs for delegating computation
• The PCP theorem by gap amplification
• Proving as fast as computing: succinct arguments with constant prover overhead
• Fiat-Shamir security of FRI and related SNARKs

Related Items (1)

Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures

This page was built for publication: STIR: Reed-Solomon proximity testing with fewer queries