{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:08Z","timestamp":1778249408099,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"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_5","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:12:59Z","timestamp":1778245979000},"page":"121-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Jagged Polynomial Commitments (or: How to\u00a0Stack Multilinears)"],"prefix":"10.1007","author":[{"given":"Tamir","family":"Hemo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Jue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene","family":"Rabinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyumin","family":"Roh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"5_CR1","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.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part X. LNCS, vol. 14929, pp. 380\u2013413. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_12","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: Reed-Solomon proximity testing with super-fast verification. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, 4\u20138 May 2025, Proceedings, Part IV. LNCS, vol. 15604, pp. 214\u2013243. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_8","DOI":"10.1007\/978-3-031-91134-7_8"},{"issue":"11","key":"5_CR3","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_CR4","doi-asserted-by":"publisher","unstructured":"Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R.D., Zeilberger, H.: Blaze: fast SNARKs from interleaved RAA codes. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, 4\u20138 May 2025, Proceedings, Part IV. LNCS, vol. 15604, pp. 123\u2013152. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_5","DOI":"10.1007\/978-3-031-91134-7_5"},{"key":"5_CR5","unstructured":"Ben-Sasson, E., Carmon, D., Hab\u00f6ck, U., Kopparty, S., Saraf, S.: On proximity gaps for Reed-Solomon codes. Electron. Colloquium Comput. Complex. TR25-169 (2025)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for Reed-Solomon codes. J. ACM 70(5), 31:1\u201331:57 (2023)","DOI":"10.1145\/3614423"},{"key":"5_CR7","unstructured":"Bagad, S., Domb, Y., Thaler, J.: The sum-check protocol over fields of small characteristic. Cryptology ePrint Archive, Paper 2024\/1046 (2024). https:\/\/eprint.iacr.org\/2024\/1046"},{"key":"5_CR8","unstructured":"B\u00fcnz, B., Fenzi, G., Rothblum, R.D., Wang, W.: TensorSwitch: nearly optimal polynomial commitments from tensor codes. IACR Cryptol. ePrint Arch. 2065 (2025)"},{"key":"5_CR9","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.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, 23\u201327 April 2023, Proceedings, Part II. LNCS, vol. 14005, pp. 499\u2013530. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"5_CR10","unstructured":"Chiesa, A., Fedele, E., Fenzi, G., Zitek-Estrada, A.: A time-space tradeoff for the sumcheck prover. IACR Cryptol. ePrint Arch. 524 (2024)"},{"key":"5_CR11","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_CR12","doi-asserted-by":"publisher","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, 4\u20138 May 2025, Proceedings, Part IV. LNCS, vol. 15604, pp. 93\u2013122. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_4","DOI":"10.1007\/978-3-031-91134-7_4"},{"key":"5_CR13","unstructured":"Dao, Q., Thaler, J.: Constraint-packing and the sum-check protocol over binary tower fields. Cryptology ePrint Archive, Paper 2024\/1038 (2024). https:\/\/eprint.iacr.org\/2024\/1038"},{"key":"5_CR14","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_CR15","doi-asserted-by":"publisher","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20\u201324 August 2023, Proceedings, Part II. LNCS, vol. 14082, pp. 193\u2013226. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"5_CR16","unstructured":"Gruen, A.: Some improvements for the PIOP for zerocheck. IACR Cryptol. ePrint Arch., 108 (2024)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Rothblum, R.: Delegating computations with (almost) minimal time and space overhead. In: Thorup, M. (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 124\u2013135. IEEE Computer Society (2018)","DOI":"10.1109\/FOCS.2018.00021"},{"key":"5_CR18","unstructured":"Irreducible Team. Batched commitment (2024). https:\/\/www.binius.xyz\/blueprint\/cryptography\/commitment\/batched\/"},{"issue":"4","key":"5_CR19","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"},{"key":"5_CR20","unstructured":"Rothblum, R.D.: A note on efficient computation of the multilinear extension. IACR Cryptol. ePrint Arch. 1103 (2024)"},{"issue":"3","key":"5_CR21","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_CR22","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. SIAM J. Comput. 50(3), 201 (2016)","DOI":"10.1145\/2897518.2897652"},{"key":"5_CR23","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_CR24","unstructured":"Soukhanov, L., Rebenko, Y.: Morgana: a laconic circuit builder. IACR Cryptol. ePrint Arch. 65 (2025)"},{"key":"5_CR25","unstructured":"Setty, S.T.V., Thaler, J.: Twist and shout: faster memory checking arguments via one-hot addressing and increments. IACR Cryptol. ePrint Arch. 105 (2025)"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Setty, S.T.V., Thaler, J., Wahby, R.S.: Unlocking the lookup singularity with Lasso. In: Joye, M., Leander, G. (eds.) Advances in Cryptology - EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, 26\u201330 May 2024, Proceedings, Part VI. LNCS, vol. 14656, pp. 180\u2013209. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"5_CR27","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, 19\u201322 May 2013, pp. 223\u2013237. IEEE Computer Society (2013)","DOI":"10.1109\/SP.2013.48"},{"key":"5_CR28","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.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part X. LNCS, vol. 14929, pp. 138\u2013169. Springer, Heidelberg (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 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:13:06Z","timestamp":1778245986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_5","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"}}]}}