{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:26:11Z","timestamp":1781519171731,"version":"3.54.1"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018861","type":"print"},{"value":"9783032018878","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-01887-8_17","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:23Z","timestamp":1755371843000},"page":"515-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Commitments for\u00a0Galois Rings and\u00a0Applications to\u00a0SNARKs Over $$\\mathbb {Z}_{2^k}$$"],"prefix":"10.1007","author":[{"given":"Yuhao","family":"Jia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Songsong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yizhou","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.K.: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable - (extended abstract). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 102\u2013132. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_4","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"17_CR2","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. 14656, 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"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS 2017, pp. 2087\u20132104. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"17_CR4","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":"17_CR5","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. (eds.) EUROCRYPT 2025. LNCS, vol. 15604, pp. 214\u2013243. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_8","DOI":"10.1007\/978-3-031-91134-7_8"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Arnon, G., Chiesa, A., Yogev, E.: IOPs with inverse polynomial soundness error. In: FOCS 2023, pp. 752\u2013761. IEEE (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00050","DOI":"10.1109\/FOCS57990.2023.00050"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Arun, A., Setty, S.T.V., 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":"17_CR8","doi-asserted-by":"publisher","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: CCS 2021, pp. 192\u2013211. ACM (2021). https:\/\/doi.org\/10.1145\/3460120.3484812","DOI":"10.1145\/3460120.3484812"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Moz$$\\mathbb{Z}_{2}^{k}$$ arella: efficient vector-OLE and zero-knowledge proofs over $$\\mathbb{Z}_{2}^{k}$$. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 329\u2013358. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_12","DOI":"10.1007\/978-3-031-15985-5_12"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: ICALP 2018. LIPIcs, vol.\u00a0107, pp. 14:1\u201314:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"17_CR11","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/3614423","DOI":"10.1145\/3614423"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol.\u00a08043, pp. 90\u2013108. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","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"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Block, A.R., Garreta, A., Katz, J., Thaler, J., Tiwari, P.R., Zaj\u0105c, M.: Fiat-shamir security of FRI and related SNARKs. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, vol. 14439, pp. 3\u201340. Springer, Singapore (2023)","DOI":"10.1007\/978-981-99-8724-5_1"},{"key":"17_CR16","unstructured":"Bootle, J., Chiesa, A., Guan, Z., Liu, S.: Linear-time probabilistic proofs with sublinear verification for algebraic automata over every field. IACR Cryptology ePrint Archive, p.\u00a01056 (2022)"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Braun, L., de\u00a0Saint\u00a0Guilhem, C.D., Jadoul, R., Orsini, E., Smart, N.P., Tanguy, T.: ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for $$\\mathbb{Z}_{2}^{K}$$. In: Quaglia, E.A. (ed.) IMACC 2023. LNCS, vol. 14421, pp. 137\u2013157. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47818-5_8","DOI":"10.1007\/978-3-031-47818-5_8"},{"key":"17_CR18","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. (eds.) EUROCRYPT 2025. LNCS, vol. 15604, pp. 123\u2013152. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_5","DOI":"10.1007\/978-3-031-91134-7_5"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: SP 2018, pp. 315\u2013334. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 395\u2013426. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14","DOI":"10.1007\/978-3-319-96878-0_14"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Giunta, E.: On interactive oracle proofs for Boolean R1CS statements. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security. FC 2022. LNCS, vol. 13411, pp. 230\u2013247. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_11","DOI":"10.1007\/978-3-031-18283-9_11"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"de\u00a0Castro, L., Peikert, C.: Functional commitments for all functions, with transparent setup and from SIS. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 287\u2013320. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_10","DOI":"10.1007\/978-3-031-30620-4_10"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, P., Ward, N.P.: 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":"17_CR24","doi-asserted-by":"publisher","unstructured":"Cini, V., Malavolta, G., Nguyen, N.K., Wee, H.: Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 207\u2013242. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_7","DOI":"10.1007\/978-3-031-68403-6_7"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Cramer, R., Rambaud, M., Xing, C.: Asymptotically-good arithmetic secret sharing over $$\\mathbb{Z}\/p^{\\ell }\\mathbb{Z}$$ with strong multiplication and its applications to efficient MPC. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 656\u2013686. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_22","DOI":"10.1007\/978-3-030-84252-9_22"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Dalskov, A.P.K., Escudero, D., Nof, A.: Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14927, pp. 136\u2013169. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68397-8_5","DOI":"10.1007\/978-3-031-68397-8_5"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. In: Fehr, S., Fouque, P. (eds.) EUROCRYPT 2025. LNCS, vol. 15604, pp. 93\u2013122. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_4","DOI":"10.1007\/978-3-031-91134-7_4"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Escudero, D., Hong, C., Liu, H., Xing, C., Yuan, C.: Degree-D reverse multiplication-friendly embeddings: constructions and applications. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14438, pp. 106\u2013138. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_4","DOI":"10.1007\/978-981-99-8721-4_4"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Escudero, D., Song, Y., Wang, W.: Perfectly-secure multiparty computation with linear communication complexity over any modulus. In: Chung, K., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15489, pp. 102\u2013132. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_4","DOI":"10.1007\/978-981-96-0938-3_4"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Escudero, D., Xing, C., Yuan, C.: More efficient dishonest majority secure computation over $$\\mathbb{Z}_{2}^{k}$$ via Galois rings. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 383\u2013412. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_14","DOI":"10.1007\/978-3-031-15802-5_14"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Fisch, B., Liu, Z., Vesely, P.: Orbweaver: succinct linear functional commitments from lattices. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 106\u2013131. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_4","DOI":"10.1007\/978-3-031-38545-2_4"},{"key":"17_CR32","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-Bases for oecumenical noninteractive arguments of knowledge. IACR Cryptology ePrint Archive, p.\u00a0953 (2019)"},{"issue":"4","key":"17_CR33","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). https:\/\/doi.org\/10.1007\/S00145-023-09481-3","journal-title":"J. Cryptol."},{"key":"17_CR34","unstructured":"Gao, Y., Kan, H., Li, Y.: Linear proximity gap for linear codes within the 1.5 Johnson bound. IACR Cryptology ePrint Archive, p.\u00a01810 (2024). https:\/\/eprint.iacr.org\/2024\/1810"},{"key":"17_CR35","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 2023. LNCS, vol. 14082, pp. 193\u2013226. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016. LNCS, vol.\u00a09666, pp. 305\u2013326. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"issue":"6","key":"17_CR37","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45(6), 1757\u20131767 (1999). https:\/\/doi.org\/10.1109\/18.782097","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR38","unstructured":"Huang, M.M., Mao, X., Zhang, J.: Sublinear proofs over polynomial rings. IACR Cryptology ePrint Archive, p.\u00a0199 (2025). https:\/\/eprint.iacr.org\/2025\/199"},{"key":"17_CR39","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 (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_13","DOI":"10.1007\/978-3-031-68403-6_13"},{"key":"17_CR40","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 2024. 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":"17_CR41","doi-asserted-by":"publisher","unstructured":"Lin, F., Xing, C., Yao, Y., Yuan, C.: Amortized NISC over $$\\mathbb{Z}_{2}^{k}$$ from RMFE. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14438, pp. 38\u201370. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_2","DOI":"10.1007\/978-981-99-8721-4_2"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"McCoy, N.H.: Remarks on divisors of zero. Am. Math. Mon. 49(5), 286\u2013295 (1942)","DOI":"10.1080\/00029890.1942.11991226"},{"key":"17_CR43","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":"17_CR44","doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103\u2013112 (2016). https:\/\/doi.org\/10.1145\/2856449","DOI":"10.1145\/2856449"},{"key":"17_CR45","doi-asserted-by":"publisher","unstructured":"Polishchuk, A., Spielman, D.A.: Nearly-linear size holographic proofs. In: Leighton, F.T., Goodrich, M.T. (eds.) STOC 1994, pp. 194\u2013203. ACM (1994). https:\/\/doi.org\/10.1145\/195058.195132","DOI":"10.1145\/195058.195132"},{"issue":"9","key":"17_CR46","doi-asserted-by":"publisher","first-page":"5882","DOI":"10.1109\/TIT.2013.2264797","volume":"59","author":"G Quintin","year":"2013","unstructured":"Quintin, G., Barbier, M., Chabot, C.: On generalized Reed-Solomon codes over commutative and noncommutative rings. IEEE Trans. Inf. Theory 59(9), 5882\u20135897 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR47","doi-asserted-by":"publisher","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. SIAM J. Comput. 50(3) (2021). https:\/\/doi.org\/10.1137\/16M1096773","DOI":"10.1137\/16M1096773"},{"key":"17_CR48","doi-asserted-by":"publisher","unstructured":"Setty, S.T.V.: 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":"17_CR49","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.) 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":"17_CR50","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). https:\/\/doi.org\/10.1109\/18.556668","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR51","unstructured":"Von Zur\u00a0Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press (2003)"},{"key":"17_CR52","doi-asserted-by":"crossref","unstructured":"Wan, Z.X.: Lectures on Finite Fields and Galois Rings. World Scientific Publishing Company (2003)","DOI":"10.1142\/5350"},{"key":"17_CR53","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 385\u2013416. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_13","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"17_CR54","doi-asserted-by":"publisher","unstructured":"Wei, Y., Zhang, X., Deng, Y.: Transparent SNARKs over Galois rings. In: Jager, T., Pan, J. (eds.) PKC 2025. LNCS, vol. 15674, pp. 418\u2013451. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91820-9_14","DOI":"10.1007\/978-3-031-91820-9_14"},{"key":"17_CR55","unstructured":"Zeilberger, H.: Khatam: reducing the communication complexity of code-based SNARKs. IACR Cryptology ePrint Archive, p.\u00a01843 (2024). https:\/\/eprint.iacr.org\/2024\/1843"}],"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-01887-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T13:37:34Z","timestamp":1760621854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01887-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018861","9783032018878"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01887-8_17","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"}}]}}