@inproceedings{692cbe58c30945f584e8a67fc208a728,
title = "STIR: Reed-Solomon Proximity Testing with Fewer Queries",
abstract = "We present STIR (Shift To Improve Rate), an interactive oracle proof of proximity (IOPP) for Reed–Solomon codes that achieves the best known query complexity of any concretely efficient IOPP for this problem. For λ bits of security, STIR has query complexity O(logd+λ·loglogd), while FRI, a popular protocol, has query complexity O(λ·logd) (including variants of FRI based on conjectured security assumptions). STIR relies on a new technique for recursively improving the rate of the tested Reed–Solomon code. We provide an implementation of STIR compiled to a SNARK. Compared to a highly-optimized implementation of FRI, STIR achieves an improvement in argument size that ranges from 1.25× to 2.46× depending on the chosen parameters, with similar prover and verifier running times. For example, in order to achieve 128 bits of security for degree 226 and rate 1/4, STIR has argument size 114 KiB, compared to 211 KiB for FRI.",
keywords = "Interactive oracle proofs, Reed–Solomon proximity testing",
author = "Gal Arnon and Alessandro Chiesa and Giacomo Fenzi and Eylon Yogev",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2024.; 44th Annual International Cryptology Conference, CRYPTO 2024 ; Conference date: 18-08-2024 Through 22-08-2024",
year = "2024",
doi = "10.1007/978-3-031-68403-6_12",
language = "الإنجليزيّة",
isbn = "9783031684029",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media B.V.",
pages = "380--413",
editor = "Leonid Reyzin and Douglas Stebila",
booktitle = "Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings",
address = "ألمانيا",
}