STIR: Reed-Solomon Proximity Testing with Fewer Queries

Gal Arnon; Alessandro Chiesa; Giacomo Fenzi; Eylon Yogev

doi:10.1007/978-3-031-68403-6_12

STIR: Reed-Solomon Proximity Testing with Fewer Queries

Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 2²⁶ and rate 1/4, STIR has argument size 114 KiB, compared to 211 KiB for FRI.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings
Editors	Leonid Reyzin, Douglas Stebila
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	380-413
Number of pages	34
ISBN (Print)	9783031684029
DOIs	https://doi.org/10.1007/978-3-031-68403-6_12
State	Published - 2024
Event	44th Annual International Cryptology Conference, CRYPTO 2024 - Santa Barbara, United States Duration: 18 Aug 2024 → 22 Aug 2024

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14929 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	44th Annual International Cryptology Conference, CRYPTO 2024
Country/Territory	United States
City	Santa Barbara
Period	18/08/24 → 22/08/24

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2024.

Keywords

Interactive oracle proofs
Reed–Solomon proximity testing

Access to Document

10.1007/978-3-031-68403-6_12

Cite this

Arnon, G., Chiesa, A., Fenzi, G., & Yogev, E. (2024). STIR: Reed-Solomon Proximity Testing with Fewer Queries. In L. Reyzin, & D. Stebila (Eds.), Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings (pp. 380-413). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14929 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-68403-6_12

Arnon, Gal ; Chiesa, Alessandro ; Fenzi, Giacomo et al. / STIR : Reed-Solomon Proximity Testing with Fewer Queries. Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. editor / Leonid Reyzin ; Douglas Stebila. Springer Science and Business Media Deutschland GmbH, 2024. pp. 380-413 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8cc98afb11f3437eac4d6b17c08c859f,

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 Deutschland GmbH",

pages = "380--413",

editor = "Leonid Reyzin and Douglas Stebila",

booktitle = "Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings",

address = "גרמניה",

}

Arnon, G, Chiesa, A, Fenzi, G & Yogev, E 2024, STIR: Reed-Solomon Proximity Testing with Fewer Queries. in L Reyzin & D Stebila (eds), Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14929 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 380-413, 44th Annual International Cryptology Conference, CRYPTO 2024, Santa Barbara, United States, 18/08/24. https://doi.org/10.1007/978-3-031-68403-6_12

STIR: Reed-Solomon Proximity Testing with Fewer Queries. / Arnon, Gal; Chiesa, Alessandro; Fenzi, Giacomo et al.
Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. ed. / Leonid Reyzin; Douglas Stebila. Springer Science and Business Media Deutschland GmbH, 2024. p. 380-413 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14929 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - STIR

T2 - 44th Annual International Cryptology Conference, CRYPTO 2024

AU - Arnon, Gal

AU - Chiesa, Alessandro

AU - Fenzi, Giacomo

AU - Yogev, Eylon

PY - 2024

Y1 - 2024

N2 - 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.

AB - 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.

KW - Interactive oracle proofs

KW - Reed–Solomon proximity testing

UR - http://www.scopus.com/inward/record.url?scp=85202289188&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-68403-6_12

DO - 10.1007/978-3-031-68403-6_12

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85202289188

SN - 9783031684029

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 380

EP - 413

BT - Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings

A2 - Reyzin, Leonid

A2 - Stebila, Douglas

PB - Springer Science and Business Media Deutschland GmbH

Y2 - 18 August 2024 through 22 August 2024

ER -

Arnon G, Chiesa A, Fenzi G, Yogev E. STIR: Reed-Solomon Proximity Testing with Fewer Queries. In Reyzin L, Stebila D, editors, Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. Springer Science and Business Media Deutschland GmbH. 2024. p. 380-413. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-68403-6_12