{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:58:16Z","timestamp":1778291896045,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253354","type":"print"},{"value":"9783032253361","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-25336-1_4","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:12:19Z","timestamp":1778245939000},"page":"95-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Query-Optimal IOPPs for\u00a0Linear-Time Encodable Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5563-0630","authenticated-orcid":false,"given":"Anubhav","family":"Baweja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6600-9719","authenticated-orcid":false,"given":"Pratyush","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8598-3643","authenticated-orcid":false,"given":"Tushar","family":"Mopuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-0984","authenticated-orcid":false,"given":"Matan","family":"Shtepel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: Reed\u2013Solomon proximity testing with fewer queries. In: Proceedings of the 44th Annual International Cryptology Conference, CRYPTO \u201924. pp. 380\u2013413 (2024)","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: Reed\u2013Solomon proximity testing with super-fast verification. In: Proceedings of the 45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT \u201925, pp. 214\u2013243 (2025)","DOI":"10.1007\/978-3-031-91134-7_8"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Proceedings of the 24th ACM Conference on Computer and Communications Security, CCS \u201917, pp. 2087\u20132104 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"4_CR4","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed\u2013solomon interactive oracle proofs of proximity. In: Proceedings of the 45th International Colloquium on Automata, Languages and Programming, ICALP \u201918, 14:1\u201314:17 (2018)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R.D., Zeilberger, H.: Blaze: fast \u2013SNARKs from Interleaved RAA Codes. In: Proceedings of the 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT \u201925, pp. 123\u2013152 (2025)","DOI":"10.1007\/978-3-031-91134-7_5"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chiesa, A., Fenzi, G., Wang, W.: Linear-time accumulation schemes. In: Proceedings of the 23rd Theory of Cryptography Conference, TCC \u201925 (2025)","DOI":"10.1007\/978-3-032-12287-2_13"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: Proceedings of the 18th Theory of Cryptography Conference, TCC \u201920, pp. 19\u201346 (2020). https:\/\/eprint.iacr.org\/2020\/1426","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Goldberg, L., Gur, T., Riabzev, M., Spooner, N.: Linear-Size Constant-Query IOP\u2019s for Delegating Computation. In: Proceedings of the 17th Theory of Cryptography Conference, TCC \u201919, (2019)","DOI":"10.1007\/978-3-030-36033-7_19"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for reed\u2013solomon codes. J. ACM 70(5), 31:1\u201331:57 (2023). https:\/\/dblp.org\/rec\/journals\/iacr\/Ben-SassonCIKS20.html?view=bibtex","DOI":"10.1145\/3614423"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Liu, S.: Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier. In: Proceedings of the 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT \u201922, pp. 275\u2013304 (2022). https:\/\/eprint.iacr.org\/2020\/1527","DOI":"10.1007\/978-3-031-07085-3_10"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive Oracle Proofs. In: Proceedings of the 14th Theory of Cryptography Conference, TCC \u201916-B, pp. 31\u201360 (2016)","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Block, A.R., Fang, Z., Katz, J., Thaler, J., Waldner, H., Zhang, Y.: Field-Agnostic SNARKs from Expand-Accumulate Codes. In: CRYPTO\u2013(10). Lecture Notes in Computer Science (2024)","DOI":"10.1007\/978-3-031-68403-6_9"},{"key":"4_CR13","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: Proceedings of the 11th Innovations in Theoretical Computer Science Conference. ITCS 20, 5:1\u20135:32 (2020). https:\/\/eprint.iacr.org\/2019\/336"},{"key":"4_CR14","unstructured":"Baweja, A., Mishra, P., Mopuri, T., Shtepel, M.: FICS and \u2013FACS: Fast \u2013IOPPs and Accumulation via Code-Switching. Cryptology ePrint Archive, Paper 2025\/737. (2025). https:\/\/eprint.iacr.org\/2025\/737"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W. : Arc: accumulation for Reed\u2013Solomon Codes. In: Proceedings of the 45th Annual International Cryptology Conference, CRYPTO \u201925, (2025)","DOI":"10.1007\/978-3-032-01907-3_5"},{"key":"4_CR16","unstructured":"Divsalar, D., Jin, H., McEliece, R.J.: Coding theorems for turbo-like codes. In: Proceedings of the Annual Allerton Conference on Communication control and Computing, Vol. 36, pp. 201\u2013210 (1998)"},{"key":"4_CR17","unstructured":"Gao, Y., Kan, H., Li, Y.: Linear Proximity Gap for Linear Codes within the 1.5 Johnson Bound. Cryptology ePrint Archive, Paper 2024\/1810, (2024). https:\/\/eprint.iacr.org\/2024\/1810"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for \u2013R1CS. In: Proceedings of the 43rd Annual International Cryptology Conference, CRYPTO \u201923, pp. 193\u2013226 (2023). https:\/\/eprint.iacr.org\/2021\/1043","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan,N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","DOI":"10.1145\/146585.146605"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Minzer, D., Zheng, K.Z.: Improved Round-by-round Soundness \u2013IOPs via Reed\u2013Muller Codes. In: Proceedings of the 66th Annual IEEE Symposium on Foundations of Computer Science, FOCS \u201925 (2025)","DOI":"10.1109\/FOCS63196.2025.00067"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Nair, V., Sharma, A., Thankey, B.: BrakingBase - a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme. In: Proceedings of the 31st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT \u201925 (2025)","DOI":"10.1007\/978-981-95-5116-3_14"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum,R.: Local proofs approaching the witness length. In: J. ACM 71(3), 18 (2024). https:\/\/eprint.iacr.org\/2019\/1062","DOI":"10.1145\/3661483"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum, R.: Proving as fast as computing: succinct arguments with constant prover overhead. In: J. ACM 72(2), 1\u201354 (2025)","DOI":"10.1145\/3721477"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: Proceedings of the 44th Annual International Cryptology Conference, CRYPTO \u201924, pp. 138\u2013169 (2024). https:\/\/eprint.iacr.org\/2023\/1705","DOI":"10.1007\/978-3-031-68403-6_5"},{"key":"4_CR25","unstructured":"Zeilberger, H.: Khatam: Reducing the Communication Complexity of Code-Based SNARKs. Cryptology ePrint Archive, Paper 2024\/1843 (2024). https:\/\/eprint.iacr.org\/2024\/1843"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:12:30Z","timestamp":1778245950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}