{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T01:13:55Z","timestamp":1779326035316,"version":"3.51.4"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019066","type":"print"},{"value":"9783032019073","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-032-01907-3_9","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:30Z","timestamp":1755383250000},"page":"259-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["$$\\textsf{Zinc}$$: Succinct Arguments with\u00a0Small Arithmetization Overheads from\u00a0IOPs of\u00a0Proximity to\u00a0the\u00a0Integers"],"prefix":"10.1007","author":[{"given":"Albert","family":"Garreta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9083-5794","authenticated-orcid":false,"given":"Hendrik","family":"Waldner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilia","family":"Vlasov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8593-8732","authenticated-orcid":false,"given":"Katerina","family":"Hristova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3639-8500","authenticated-orcid":false,"given":"Luca","family":"Dall\u2019Ava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"\u010cupi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Attema, T., Cascudo, I., Cramer, R., Damgard, I., Escudero, D.: Vector commitments over rings and compressed $$\\sigma $$-protocols. In: Theory of Cryptography Conference. pp. 173\u2013202. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_7","DOI":"10.1007\/978-3-031-22318-1_7"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Razet, B., Scholl, P.: Appenzeller to brie: efficient zero-knowledge proofs for mixed-mode arithmetic and z2k. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 192\u2013211 (2021)","DOI":"10.1145\/3460120.3484812"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Moz z 2 k arella: efficient vector-ole and zero-knowledge proofs over z 2 k. In: Annual International Cryptology Conference. pp. 329\u2013358. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_12","DOI":"10.1007\/978-3-031-15985-5_12"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon Interactive Oracle Proofs of Proximity. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0107, pp. 14:1\u201314:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: Labrador: compact proofs for r1cs from module-sis. In: Annual International Cryptology Conference. 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":"9_CR6","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.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part X. LNCS, vol. 14929, pp. 276\u2013307. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_9","DOI":"10.1007\/978-3-031-68403-6_9"},{"key":"9_CR7","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\u00a02024, Part\u00a0X. 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":"9_CR8","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\u00a02021, Part\u00a0IV. LNCS, vol. 12828, pp. 123\u2013152. Springer, Cham, Virtual Event (Aug 2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"9_CR9","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: , T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0III. LNCS, vol. 10626, pp. 336\u2013365. Springer, Cham (Dec 2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12","DOI":"10.1007\/978-3-319-70700-6_12"},{"key":"9_CR10","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\u00a02020, Part\u00a0II. 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":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-030-84242-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bootle","year":"2021","unstructured":"Bootle, J., Chiesa, A., Sotiraki, K.: Sumcheck arguments and their applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 742\u2013773. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_26"},{"key":"9_CR12","unstructured":"Bruestle, J., Gafni, P.: Risc zero zkvm: scalable, transparent arguments of risc-v integrity. Draft. 29 (2023)"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (May 2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"9_CR14","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent snarks from dark compilers. Cryptology ePrint Archive, Paper 2019\/1229 (2019). https:\/\/eprint.iacr.org\/2019\/1229"},{"key":"9_CR15","unstructured":"Campanelli, M., Hall-Andersen, M.: Fully-succinct arguments over the integers from first principles. Cryptology ePrint Archive, Paper 2024\/1548 (2024). https:\/\/eprint.iacr.org\/2024\/1548"},{"key":"9_CR16","unstructured":"Chen, S., Cheon, J.H., Kim, D., Park, D.: Verifiable computing for approximate computation. Cryptology ePrint Archive (2019)"},{"key":"9_CR17","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, P., Ward, N.: Marlin: Preprocessing zkSNARKs with universal and updatable SRS. Cryptology ePrint Archive, Paper 2019\/1047 (2019). https:\/\/eprint.iacr.org\/2019\/1047, https:\/\/eprint.iacr.org\/2019\/1047"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-030-45721-1_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","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"},{"key":"9_CR19","unstructured":"Chiesa, A., Yogev, E.: Building Cryptographic Proofs from Hash Functions (2024), https:\/\/github.com\/hash-based-snargs-book"},{"key":"9_CR20","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. Cryptology ePrint Archive, Paper 2023\/1784 (2023). https:\/\/eprint.iacr.org\/2023\/1784"},{"key":"9_CR21","unstructured":"Diamond, B.E., Posen, J.: Polylogarithmic proofs for multilinears over binary towers. Cryptology ePrint Archive (2024)"},{"key":"9_CR22","unstructured":"Eli, B.S.: State of stwo. https:\/\/www.youtube.com\/watch?v=Gs2HwJIgdxc"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: Snarks for ring arithmetic. J. Cryptol. 36(4), 41 (2023)","journal-title":"J. Cryptol."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Garreta, A., Waldner, H., Hristova, K., Dall\u2019Ava, L.: $${\\sf Zinc}$$: Succinct arguments with small arithmetization overheads from IOPs of proximity to the integers. Cryptology ePrint Archive, Paper 2025\/316 (2025). https:\/\/eprint.iacr.org\/2025\/316","DOI":"10.1007\/978-3-032-01907-3_9"},{"key":"9_CR25","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, August 20-24, 2023, Proceedings, Part II. LNCS, vol. 14082, pp. 193\u2013226. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"9_CR26","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.) CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 193\u2013226. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"9_CR27","unstructured":"Hab\u00f6ck, U., Levit, D., Papini, S.: Circle STARKs. Cryptology ePrint Archive, Paper 2024\/278 (2024). https:\/\/eprint.iacr.org\/2024\/278"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Lin, F., Xing, C., Yao, Y.: More efficient zero-knowledge protocols over $$\\mathbb{Z} _{2^k}$$ via galois rings. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0IX. LNCS, vol. 14928, pp. 424\u2013457. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_13","DOI":"10.1007\/978-3-031-68400-5_13"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Orr\u00f9, M., Kadianakis, G., Maller, M., Zaverucha, G.: Beyond the circuit: How to minimize foreign arithmetic in zkp circuits. Cryptology ePrint Archive (2024)","DOI":"10.62056\/an-4c3c2h"},{"key":"9_CR30","unstructured":"Plonky3: Plonky3. https:\/\/github.com\/Plonky3\/Plonky3"},{"key":"9_CR31","unstructured":"Setty, S.: Spartan: Efficient and general-purpose zkSNARKs without trusted setup. Cryptology ePrint Archive, Paper 2019\/550 (2019). https:\/\/eprint.iacr.org\/2019\/550"},{"key":"9_CR32","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive (2023)"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Soria-Vazquez, E.: Doubly efficient interactive proofs over infinite and non-commutative rings. In: Theory of Cryptography Conference, pp. 497\u2013525. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_18","DOI":"10.1007\/978-3-031-22318-1_18"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge. Foundations Trends\u00ae Priv. Sec. 4(2\u20134), 117\u2013660 (2022)","DOI":"10.1561\/3300000030"},{"key":"9_CR35","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: Basefold: Efficient field-agnostic polynomial commitment schemes from foldable codes. Cryptology ePrint Archive, Paper 2023\/1705 (2023). https:\/\/eprint.iacr.org\/2023\/1705"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T01:19:27Z","timestamp":1757467167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_9","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}