{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:56:57Z","timestamp":1778291817540,"version":"3.51.4"},"publisher-location":"Cham","reference-count":75,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911330","type":"print"},{"value":"9783031911347","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91134-7_5","type":"book-chapter","created":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:04:49Z","timestamp":1745665489000},"page":"123-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Blaze: Fast SNARKs from\u00a0Interleaved RAA Codes"],"prefix":"10.1007","author":[{"given":"Martijn","family":"Brehm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0835-9678","authenticated-orcid":false,"given":"Binyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1154-2277","authenticated-orcid":false,"given":"Ben","family":"Fisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-5631","authenticated-orcid":false,"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5481-7276","authenticated-orcid":false,"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5633-0126","authenticated-orcid":false,"given":"Hadas","family":"Zeilberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,27]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Fenzi, G., Lapiha, O., Nguyen, N.K.: SLAP: succinct lattice-based polynomial commitments from standard assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14657, pp. 90\u2013119. Springer, Cham. (2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_4","DOI":"10.1007\/978-3-031-58754-2_4"},{"issue":"11","key":"5_CR2","doi-asserted-by":"publisher","first-page":"3379","DOI":"10.1007\/s10623-023-01222-8","volume":"91","author":"S Ames","year":"2023","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. Des. Codes Cryptogr. 91(11), 3379\u20133424 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: reed-solomon proximity testing with fewer queries. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 380\u2013413. Springer, Cham (2024).https:\/\/doi.org\/10.1007\/978-3-031-68403-6_12","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs; A new characterization of NP. In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 2\u201313. IEEE Computer Society (1992)","DOI":"10.1109\/SFCS.1992.267824"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Arun, A., Setty, S., Thaler, J.: Jolt: SNARKs for virtual machines via lookups. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14656, pp. 3\u201333. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_1","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Bangalore, L., Bhadauria, R., Hazay, C., Venkitasubramaniam, M.: On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. LNCS, vol. 13747, pp. 417\u2013446. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_15","DOI":"10.1007\/978-3-031-22318-1_15"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TIT.2008.2008114","volume":"55","author":"L Bazzi","year":"2008","unstructured":"Bazzi, L., Mahdian, M., Spielman, D.A.: The minimum distance of turbo-like codes. IEEE Trans. Inf. Theory 55(1), 6\u201315 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR8","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In:\u00a0Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, vol. 107. LIPIcs, pp. 14:1\u201314:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"5_CR9","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch., p.\u00a046 (2018)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Carmon, D.,\u00a0Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for Reed\u2013Solomon codes. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 900\u2013909. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive Oracle Proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"5_CR12","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: Vidick, T. (ed.) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA, vol. 151. LIPIcs, pp. 5:1\u20135:32. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2020"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0097539705446810","volume":"36","author":"E Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM J. Comput. 36(4), 889\u2013974 (2006)","journal-title":"SIAM J. Comput."},{"key":"5_CR14","unstructured":"Ben-Sasson, E., Kopparty, S., Saraf, S.: Worst-case to average case reductions for the distance to a code. In: Servedio, R.A. (ed.) 33rd Computational Complexity Conference, CCC 2018, June 22-24, 2018, San Diego, CA, USA, vol. 102. LIPIcs, pp. 24:1\u201324:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 518\u2013548. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Bhadauria, R., Fang, Z., Hazay, C., Venkitasubramaniam, M., Xie, T., Zhang, Y.: Ligero++: a new optimized sublinear IOP. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) CCS \u201920: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, November 9-13, 2020, pp. 2025\u20132038. ACM (2020)","DOI":"10.1145\/3372297.3417893"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Block, A.R., Fang, Z., Katz, J., Thaler, J., Waldner, H., Zhang, Y.: Field-agnostic SNARKs from expand-accumulate codes. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 276\u2013307. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_9","DOI":"10.1007\/978-3-031-68403-6_9"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Public-coin zero-knowledge arguments with (almost) minimal time and space overheads. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 168\u2013197. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_7","DOI":"10.1007\/978-3-030-64378-2_7"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 123\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"5_CR20","unstructured":"Boneh, D., Chen, B.: LatticeFold: a lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive, Paper 2024\/257 (2024)"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 336\u2013365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12","DOI":"10.1007\/978-3-319-70700-6_12"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 19\u201346. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_2","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Bootle, J., Chiesa, A., Hu, Y., Orr\u00fa, M.: Gemini: elastic SNARKs for diverse environments. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276, pp. 427\u2013457. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_15","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 603\u2013633. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Oblivious transfer with constant computational overhead. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14004, pp. 271\u2013302. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_10","DOI":"10.1007\/978-3-031-30545-0_10"},{"key":"5_CR27","unstructured":"Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R.D., Zeilberger, H.: Blaze: fast SNARKs from interleaved RAA codes. Cryptology ePrint Archive, Paper 2024\/1609 (2024)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21-23 May 2018, San Francisco, California, USA, pp. 315\u2013334. IEEE Computer Society (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK Compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 1082\u20131090 (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14005, pp. 499\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"5_CR32","unstructured":"Chiesa, A., Fedele, E., Fenzi, G., Zitek-Estrada, A.: A time-space tradeoff for the sumcheck prover. IACR Cryptol. ePrint Arch., p. 524 (2024)"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Manohar, P., Spooner, N.: Succinct arguments in the quantum random oracle model. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 1\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_1","DOI":"10.1007\/978-3-030-36033-7_1"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 769\u2013793. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"5_CR36","unstructured":"Chiesa, A., Yogev, E.: Building Cryptographic Proofs from Hash Functions (2024)"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Cini, V., Malavolta, G., Nguyen, N.K., Wee, H.: Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup. In: Annual International Cryptology Conference - CRYPTO, pp. 207\u2013242. Springer (2024)","DOI":"10.1007\/978-3-031-68403-6_7"},{"key":"5_CR38","unstructured":"den Hollander, T., Slamanig, D.: A crack in the firmament: Restoring soundness of the Orion proof system and more. Cryptology ePrint Archive, Paper 2024\/1164 (2024)"},{"key":"5_CR39","unstructured":"Diamond, B.E.,\u00a0Posen, J.: Succinct arguments over towers of binary fields. IACR Cryptol. ePrint Arch., p. 1784 (2023)"},{"key":"5_CR40","unstructured":"Diamond, B.E., Posen, J.: Polylogarithmic proofs for multilinears over binary towers. Cryptology ePrint Archive, Paper 2024\/504 (2024). https:\/\/eprint.iacr.org\/2024\/504"},{"key":"5_CR41","unstructured":"Divsalar, D., Jin, H., McEliece, R.J.: Coding theorems for \u201cturbo-like\u201d codes. In: Proceedings of the annual Allerton Conference on Communication control and Computing, vol.\u00a036, pp. 201\u2013210. University Of Illinois (1998)"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (eds) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). doihttps:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Freitag, C., Paneth, O., Pass, R.: Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14654, pp. 112\u2013141. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58737-5_5","DOI":"10.1007\/978-3-031-58737-5_5"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM 62(4), 27:1\u201327:64 (2015)","DOI":"10.1145\/2699436"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Annual International Cryptology Conference, pp. 193\u2013226 (2023)","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"5_CR46","unstructured":"Gur, T., Rothblum, R.D.: A hierarchy theorem for interactive proofs of proximity. In: Papadimitriou, C.H., (eds.) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA, vol. 67. LIPIcs, pp. 39:1\u201339:43. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"5_CR47","unstructured":"Hab\u00f6ck, U., Levit, D., Papini, S.: Circle STARKs. IACR Cryptol. ePrint Arch., p. 278 (2024)"},{"key":"5_CR48","doi-asserted-by":"publisher","unstructured":"Holmgren, J., Rothblum, R.D.: Faster Sounder Succinct Arguments and IOPs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 474\u2013503. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_17","DOI":"10.1007\/978-3-031-15802-5_17"},{"key":"5_CR49","doi-asserted-by":"publisher","unstructured":"Hwang, I., Seo, J., Song, Y.: Concretely efficient lattice-based polynomial commitment from standard assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 414\u2013448. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_13","DOI":"10.1007\/978-3-031-68403-6_13"},{"key":"5_CR50","doi-asserted-by":"publisher","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Kattis, A.A., Panarin, K., Vlasov, A.: RedShift: transparent SNARKs from list polynomial commitments. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (2022)","DOI":"10.1145\/3548606.3560657"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, J.A., (eds.) Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pp. 723\u2013732. ACM (1992)","DOI":"10.1145\/129712.129782"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Kliewer, J., Zigangirov, K.S., Costello\u00a0Jr., D.J.: New results on the minimum distance of repeat multiple accumulate codes. In: Proc. 45th Annual Allerton Conf. Commun., Control, and Computing (2007)","DOI":"10.1109\/ALLERTON.2008.4797726"},{"key":"5_CR54","doi-asserted-by":"crossref","unstructured":"Kliewer, J., Zigangirov, K.S., Koller, C., Costello Jr., D.J.: Coding theorems for repeat multiple accumulate codes (2008)","DOI":"10.1109\/ITA.2009.5044939"},{"key":"5_CR55","first-page":"917","volume":"2023","author":"T Kohrita","year":"2023","unstructured":"Kohrita, T., Towa, P.: Zeromorph: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments. Cryptology ePrint Archive 2023, 917 (2023)","journal-title":"Cryptology ePrint Archive"},{"issue":"4","key":"5_CR56","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"RE Ladner","year":"1980","unstructured":"Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM 27(4), 831\u2013838 (1980)","journal-title":"J. ACM"},{"key":"5_CR57","doi-asserted-by":"crossref","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. IACR Cryptol. ePrint Arch., p. 1274 (2020)","DOI":"10.1007\/978-3-030-90453-1_1"},{"issue":"4","key":"5_CR58","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","journal-title":"J. ACM"},{"issue":"1","key":"5_CR59","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/110829660","volume":"42","author":"O Meir","year":"2013","unstructured":"Meir, O.: IP = PSPACE using error-correcting codes. SIAM J. Comput. 42(1), 380\u2013403 (2013)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR60","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"5_CR61","doi-asserted-by":"publisher","unstructured":"Nguyen, N.K., Seiler, G.: Greyhound: fast polynomial commitments from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 243\u2013275. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_8","DOI":"10.1007\/978-3-031-68403-6_8"},{"key":"5_CR62","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, R.D., Rothblum, G.N.: Constant-round interactive proofs for delegating computation. Electron. Colloquium Comput. Complex., TR16-061 (2016)","DOI":"10.1145\/2897518.2897652"},{"issue":"3","key":"5_CR63","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/3661483","volume":"71","author":"N Ron-Zewi","year":"2024","unstructured":"Ron-Zewi, N., Rothblum, R.: Local proofs approaching the witness length. J. ACM 71(3), 18 (2024)","journal-title":"J. ACM"},{"key":"5_CR64","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. In: Leonardi, S., Gupta, A., (eds.) STOC \u201922: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 1353\u20131363. ACM (2022)","DOI":"10.1145\/3519935.3519956"},{"key":"5_CR65","doi-asserted-by":"crossref","unstructured":"Rothblum, G.N., Vadhan, S.P., Wigderson, A.: Interactive proofs of proximity: delegating computation in sublinear time. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1-4, 2013, pp. 793\u2013802. ACM (2013)","DOI":"10.1145\/2488608.2488709"},{"key":"5_CR66","unstructured":"Rothblum, R.D.: A note on efficient computation of the multilinear extension. Cryptology ePrint Archive, Paper 2024\/1103 (2024). https:\/\/eprint.iacr.org\/2024\/1103"},{"key":"5_CR67","doi-asserted-by":"publisher","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"5_CR68","unstructured":"Setty, S.T.V., Lee, J.: Quarks: quadruple-efficient transparent zkSNARKs. IACR Cryptol. ePrint Arch., p. 1275 (2020)"},{"key":"5_CR69","doi-asserted-by":"publisher","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with lasso. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14656, pp. 180\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7","DOI":"10.1007\/978-3-031-58751-1_7"},{"issue":"6","key":"5_CR70","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"DA Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2\u20134","key":"5_CR71","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/3300000030","volume":"4","author":"J Thaler","year":"2022","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge. Found. Trends Priv. Secur. 4(2\u20134), 117\u2013660 (2022)","journal-title":"Found. Trends Priv. Secur."},{"key":"5_CR72","doi-asserted-by":"crossref","unstructured":"Vu, V., Setty, S.T.V., Blumberg, A.J., Walfish, M.: A hybrid architecture for interactive verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, USA, May 19-22, 2013, pp. 223\u2013237. IEEE Computer Society (2013)","DOI":"10.1109\/SP.2013.48"},{"key":"5_CR73","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21-23 May 2018, San Francisco, California, USA, pp. 926\u2013943. IEEE Computer Society (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"5_CR74","doi-asserted-by":"publisher","unstructured":"Xie, T., Zhang, Y., Song, D. (2022). Orion: Zero Knowledge Proof with Linear Prover Time. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 299\u2013328. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"5_CR75","doi-asserted-by":"publisher","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: Reyzin, L., Stebila, D. (eds) CRYPTO 2024. LNCS, vol. 14929, pp. 138\u2013169. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_5","DOI":"10.1007\/978-3-031-68403-6_5"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91134-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:05:01Z","timestamp":1745665501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91134-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911330","9783031911347"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91134-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}