{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T01:28:45Z","timestamp":1786411725366,"version":"3.56.0"},"publisher-location":"Singapore","reference-count":47,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550982","type":"print"},{"value":"9789819550999","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5099-9_11","type":"book-chapter","created":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T12:10:29Z","timestamp":1765195829000},"page":"330-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["LatticeFold: A Lattice-Based Folding Scheme and\u00a0Its Applications to\u00a0Succinct Proof Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0820-0421","authenticated-orcid":false,"given":"Dan","family":"Boneh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0835-9678","authenticated-orcid":false,"given":"Binyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (May 1996)","DOI":"10.1145\/237814.237838"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-84245-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Lai, R.W.F.: Subtractive sets over cyclotomic rings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 519\u2013548. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_18"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R., Kohl, L.: A compressed $$sigma$$-protocol theory for\u00a0lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 549\u2013579. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Attema, T., Fehr, S.: Parallel repetition of ($$k_1, \\dots , k_{\\mu }$$)-special-sound multi-round interactive proofs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part I, volume 13507 of LNCS, pp. 415\u2013443. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_15","DOI":"10.1007\/978-3-031-15802-5_15"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-030-56880-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Attema","year":"2020","unstructured":"Attema, T., Lyubashevsky, V., Seiler, G.: Practical product proofs for lattice commitments. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 470\u2013499. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_17"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-44381-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 276\u2013294. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1017\/S0963548317000566","volume":"27","author":"A Bishnoi","year":"2018","unstructured":"Bishnoi, A., Clark, P.L., Potukuchi, A., Schmitt, J.R.: On zeros of a polynomial in a finite grid. Comb. Probab. Comput. 27(3), 310\u2013333 (2018)","journal-title":"Comb. Probab. Comput."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Chen, B.: LatticeFold: A lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive, Report 2024\/257 (2024)","DOI":"10.1007\/978-981-95-5099-9_11"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Chen, B.: LatticeFold+: faster, simpler, shorter lattice-based folding for succinct proof systems. Cryptology ePrint Archive, Report 2025\/247 (2025)","DOI":"10.1007\/978-3-032-01907-3_11"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo Infinite: proof-carrying data from additive polynomial commitments. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 649\u2013680. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_23","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-030-26948-7_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Bootle","year":"2019","unstructured":"Bootle, J., Lyubashevsky, V., Seiler, G.: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 176\u2013202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_7"},{"key":"11_CR14","unstructured":"Bowe, S., Grigg, J., Hopwood., D.: Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: Generic efficient accumulation\/folding for special sound protocols. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: proof-carrying data without succinct arguments. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 681\u2013710. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64378-2_1","volume-title":"Theory of Cryptography","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 1\u201318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1"},{"key":"11_CR18","unstructured":"Chen, S., Cheon, J.H., Kim, D., Park, D.: Verifiable computing for approximate computation. Cryptology ePrint Archive, Report 2019\/762 (2019)"},{"key":"11_CR19","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: Yao, A.C.-C. (ed.) ICS 2010, pp. 310\u2013331. Tsinghua University Press (Jan 2010)"},{"key":"11_CR20","unstructured":"Datta, T., Boneh, D.: Using zk proofs to fight disinformation (2022). link"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-21568-2_4","volume-title":"Applied Cryptography and Network Security","author":"MF Esgin","year":"2019","unstructured":"Esgin, M.F., Steinfeld, R., Sakzad, A., Liu, J.K., Liu, D.: Short lattice-based one-out-of-many proofs and applications to ring signatures. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 67\u201388. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_4"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Fenzi, G., Knabenhans, C., Nguyen, N.K., Pham, D.T.: Lova: lattice-based folding scheme from unstructured lattices. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCs, vol. 15487. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_10","DOI":"10.1007\/978-981-96-0894-2_10"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Fenzi, G., Knabenhans, C., Nguyen, N.K., Pham, D.T.: Lova: Lattice-based folding scheme from unstructured lattices. Cryptology ePrint Archive, Report 2024\/1964 (2024)","DOI":"10.1007\/978-981-96-0894-2_10"},{"key":"11_CR24","unstructured":"Fenzi, G., Moghaddas, H., Nguyen, N.K.: Lattice-based polynomial commitments: Towards asymptotic and concrete efficiency. Cryptology ePrint Archive, Paper 2023\/846 (2023). https:\/\/eprint.iacr.org\/2023\/846"},{"key":"11_CR25","unstructured":"Garreta, A.: Implementing latticefold: Advancing post-quantum folding. ZKProof 7 (2024). link"},{"key":"11_CR26","unstructured":"Kang, D., Hashimoto, T., Stoica, I., Sun, Y.: Zk-img: Attested images via zero-knowledge proofs to fight disinformation (2022)"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Kloo\u00df, M., Lai, R.W.F., Nguyen, N.K., Osadnik, M: RoK, paper, SISsors \u2013 toolkit for lattice-based succinct arguments. Cryptology ePrint Archive, Report 2024\/1972 (2024)","DOI":"10.1007\/978-981-96-0935-2_7"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Lai, R.W.F., Nguyen, N.K., Osadnik, M.: RoK, Paper, SISsors toolkit for lattice-based succinct arguments. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. ASIACRYPT 2024. LNCS, vol. 15488. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_7","DOI":"10.1007\/978-981-96-0935-2_7"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_21","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"11_CR30","unstructured":"Kothapalli, A., Setty, S.: SuperNova: Proving universal machine executions without universal circuits. Cryptology ePrint Archive, Report 2022\/1758 (2022)"},{"key":"11_CR31","unstructured":"Kothapalli, A., Setty, S.: Cyclefold: Folding-scheme-based recursive arguments over a cycle of elliptic curves. Cryptology ePrint Archive (2023)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Kothapalli A., Setty, S.: Hypernova: Recursive arguments for customizable constraint systems. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds) CRYPTO 2022. LNCS, vol 13510. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"issue":"3","key":"11_CR34","first-page":"565","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. DCC 75(3), 565\u2013599 (2015)","journal-title":"DCC"},{"issue":"4","key":"11_CR35","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., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM (JACM) 39(4), 859\u2013868 (1992)","journal-title":"J. ACM (JACM)"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 144\u2013155. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_13"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-78381-9_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"V Lyubashevsky","year":"2018","unstructured":"Lyubashevsky, V., Seiler, G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 204\u2013224. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_8"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography. Springer, Berlin (2009).https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"11_CR39","unstructured":"Mohnblatt, N.: Sangria: a folding scheme for PLONK (2023). link"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Naveh, A., Tromer, E.: PhotoProof: cryptographic image authentication for any set of permissible transformations. In: 2016 IEEE Symposium on Security and Privacy, pp. 255\u2013271. IEEE Computer Society Press (May 2016)","DOI":"10.1109\/SP.2016.23"},{"key":"11_CR41","unstructured":"Nguyen, W., Boneh, D., Setty, S.: Revisiting the nova proof system on a cycle of curves. Cryptology ePrint Archive, Paper 2023\/969 (2023). https:\/\/eprint.iacr.org\/2023\/969"},{"key":"11_CR42","unstructured":"Nguyen, W., Setty, S.: Neo: lattice-based folding scheme for CCS over small fields and pay-per-bit commitments. Cryptology ePrint Archive, Report 2025\/294 (2025)"},{"key":"11_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145\u2013166. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_8"},{"key":"11_CR44","unstructured":"R\u00e0fols, C., Zacharakis, A.: Folding schemes with selective verification. Cryptology ePrint Archive, Report 2022\/1576 (2022)"},{"key":"11_CR45","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive (2023)"},{"key":"11_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Xie, T., et al.: zkBridge: trustless cross-chain bridges made practical. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 3003\u20133017. ACM Press (2022)","DOI":"10.1145\/3548606.3560652"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5099-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T17:49:09Z","timestamp":1770659349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5099-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550982","9789819550999"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5099-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}