{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:31:06Z","timestamp":1786368666229,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":77,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354266","type":"print"},{"value":"9783032354242","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-35424-2_17","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T12:59:48Z","timestamp":1786366788000},"page":"492-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neo and\u00a0SuperNeo: Post-quantum Folding with\u00a0Pay-per-Bit Costs over\u00a0Small Fields"],"prefix":"10.1007","author":[{"given":"Wilson","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinath","family":"Setty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Aardal, M.A., Aranha, D.F., Boudgoust, K., Kolby, S., Takahashi, A.: Aggregating falcon signatures with LaBRADOR. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0I. Lecture Notes in Computer Science, vol. 14920, pp. 71\u2013106, Santa Barbara, CA, USA. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_3","DOI":"10.1007\/978-3-031-68376-3_3"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. ACM Press, Philadelphia, PA, USA (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"17_CR3","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"},{"key":"17_CR4","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. Cryptology ePrint Archive, Report 2015\/1092 (2015). https:\/\/eprint.iacr.org\/2015\/1092"},{"key":"17_CR5","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: Reed\u2013solomon proximity testing with super-fast verification. Cryptology ePrint Archive, Report 2024\/1586 (2024). https:\/\/eprint.iacr.org\/2024\/1586"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R., Kohl, L.: A compressed $$\\Sigma $$-protocol theory for lattices. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0II. Lecture Notes in Computer Science, vol. 12826, pp. 549\u2013579. Springer, Cham, Switzerland, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"17_CR7","unstructured":"Attema, T., Kloo\u00df, M., Lai, R.W.F., Yatsyna, P.: Adaptive special soundness: Improved knowledge extraction by adaptive useful challenge sampling. Cryptology ePrint Archive, Report 2024\/2038 (2024). https:\/\/eprint.iacr.org\/2024\/2038"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable Zero Knowledge with No Trusted Setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/s00453-016-0221-0","volume":"79","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable Zero Knowledge Via Cycles of Elliptic Curves. Algorithmica 79(4), 1102\u20131160 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0221-0","journal-title":"Algorithmica"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: Compact proofs for R1CS from module-SIS. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0V. Lecture Notes in Computer Science, vol. 14085, pp. 518\u2013548. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKs and proof-carrying data. In: STOC (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"17_CR12","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, Paper 2024\/257 (2024)","DOI":"10.1007\/978-981-95-5099-9_11"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Chen, B.: LatticeFold: A lattice-based folding scheme and its applications to succinct proof systems. In: Hanaoka, G., Yang, B.Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02025, Part\u00a0III. Lecture Notes in Computer Science, vol. 16247, pp. 330\u2013362. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-981-95-5099-9_11","DOI":"10.1007\/978-981-95-5099-9_11"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Boneh, D., Chen, B.: LatticeFold+: Faster, simpler, shorter lattice-based folding for succinct proof systems. In: Kalai, Y.T., Kamara, S.F. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02025, Part\u00a0VII. Lecture Notes in Computer Science, vol. 16006, pp. 327\u2013361. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_11","DOI":"10.1007\/978-3-032-01907-3_11"},{"key":"17_CR15","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). https:\/\/eprint.iacr.org\/2025\/247","DOI":"10.1007\/978-3-032-01907-3_11"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"17_CR17","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":"17_CR18","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: Generic efficient accumulation\/folding for special sound protocols. Cryptology ePrint Archive, Paper 2023\/620 (2023)","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chiesa, A., Fenzi, G., Wang, W.: Linear-time accumulation schemes. In: Applebaum, B., Lin, H.R. (eds.) TCC\u00a02025: 23rd Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 16268, pp. 369\u2013399. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-12287-2_13","DOI":"10.1007\/978-3-032-12287-2_13"},{"key":"17_CR20","unstructured":"Bunz, B., Fenzi, G., Rothblum, R., Wang, W.: Tensorswitch: Nearly optimal polynomial commitments from tensor codes. Cryptology ePrint Archive, Paper 2025\/2065 (2025). https:\/\/eprint.iacr.org\/2025\/2065"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","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"},{"key":"17_CR22","unstructured":"Bunz, B., Mishra, P., Nguyen, W., Wang, W.: Arc: Accumulation for reed\u2013solomon codes. Cryptology ePrint Archive, Paper 2024\/1731 (2024)"},{"key":"17_CR23","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. Cryptology ePrint Archive, Paper 2024\/474 (2024)"},{"key":"17_CR24","unstructured":"Chen, B.: Symphony: Scalable SNARKs in the random oracle model from lattice-based high-arity folding. Cryptology ePrint Archive, Report 2025\/1905 (2025). https:\/\/eprint.iacr.org\/2025\/1905"},{"key":"17_CR25","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. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"17_CR26","unstructured":"Chen, S., Cheon, J.H., Kim, D., Park, D.: Verifiable computing for approximate computation. Cryptology ePrint Archive, Report 2019\/762 (2019). https:\/\/eprint.iacr.org\/2019\/762"},{"key":"17_CR27","unstructured":"Chen, W., Chiesa, A., Dauterman, E., Ward, N.P.: Reducing participation costs via incremental verification for ledger systems. Cryptology ePrint Archive, Report 2020\/1522 (2020)"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","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"},{"key":"17_CR29","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":"17_CR30","doi-asserted-by":"publisher","unstructured":"Cini, V., Lai, R.W.F., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials - (extended abstract). In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0II. Lecture Notes in Computer Science, vol. 14082, pp. 72\u2013105. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_3","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"17_CR31","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.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0X. Lecture Notes in Computer Science, 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_CR32","unstructured":"Coratger, T., Setty, S.: Post Quantum Signature Aggregation: a Folding Approach (2025). https:\/\/ethresear.ch\/t\/post-quantum-signature-aggregation-a-folding-approach\/23639"},{"key":"17_CR33","unstructured":"Eagen, L., Gabizon, A.: Protogalaxy: Efficient protostar-style folding of multiple instances. Cryptology ePrint Archive, Paper 2023\/1106 (2023)"},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-030-64834-3_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MF Esgin","year":"2020","unstructured":"Esgin, M.F., Nguyen, N.K., Seiler, G.: Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 259\u2013288. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_9"},{"key":"17_CR35","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, Paper 2024\/1964 (2024)","DOI":"10.1007\/978-981-96-0894-2_10"},{"key":"17_CR36","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, K.M., Sasaki, Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02024, Part\u00a0IV. Lecture Notes in Computer Science, vol. 15487, pp. 303\u2013326. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_10","DOI":"10.1007\/978-981-96-0894-2_10"},{"key":"17_CR37","doi-asserted-by":"publisher","unstructured":"Fenzi, G., Moghaddas, H., Nguyen, N.K.: Lattice-based polynomial commitments: Towards asymptotic and concrete efficiency. J. Cryptol. 37(3), 31 (2024). https:\/\/doi.org\/10.1007\/s00145-024-09511-8","DOI":"10.1007\/s00145-024-09511-8"},{"issue":"12","key":"17_CR38","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1109\/PROC.1966.5273","volume":"54","author":"MJ Flynn","year":"2005","unstructured":"Flynn, M.J.: Very high-speed computing systems. Proc. IEEE 54(12), 1901\u20131909 (2005)","journal-title":"Proc. IEEE"},{"issue":"9","key":"17_CR39","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TC.1972.5009071","volume":"100","author":"MJ Flynn","year":"2009","unstructured":"Flynn, M.J.: Some computer organizations and their effectiveness. IEEE Trans. Comput. 100(9), 948\u2013960 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR40","doi-asserted-by":"crossref","unstructured":"Garreta, A., Lipmaa, H., Luha\u00e4\u00e4r, U., Osadnik, M.: Cyclo: Lightweight lattice-based folding via partial range checks. Cryptology ePrint Archive (2026)","DOI":"10.1007\/978-3-032-25336-1_2"},{"key":"17_CR41","doi-asserted-by":"publisher","unstructured":"Gentry, C., Halevi, S., Lyubashevsky, V.: Practical non-interactive publicly verifiable secret sharing with thousands of parties. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0I. Lecture Notes in Computer Science, vol. 13275, pp. 458\u2013487. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_16","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"17_CR42","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: A new hash function for zero-knowledge proof systems. Cryptology ePrint Archive, Paper 2019\/458 (2019)"},{"key":"17_CR43","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Butin, D., Gazdag, S.L., Rijneveld, J., Mohaisen, A.: XMSS: eXtended Merkle signature scheme. RFC 8391 (2018)","DOI":"10.17487\/RFC8391"},{"key":"17_CR44","doi-asserted-by":"publisher","unstructured":"Jyrkinen, K., Lai, R.W.F.: Vanishing short integer solution, revisited - reductions, trapdoors, homomorphic signatures for low-degree polynomials. In: Jager, T., Pan, J. (eds.) PKC\u00a02025: 28th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. Lecture Notes in Computer Science, vol. 15675, pp. 273\u2013300. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91823-0_9","DOI":"10.1007\/978-3-031-91823-0_9"},{"key":"17_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","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"},{"key":"17_CR46","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC (1992)","DOI":"10.1145\/129712.129782"},{"key":"17_CR47","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 - (extended abstract). In: Chung, K.M., Sasaki, Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02024, Part\u00a0V. Lecture Notes in Computer Science, vol. 15488, pp. 203\u2013235. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_7","DOI":"10.1007\/978-981-96-0935-2_7"},{"key":"17_CR48","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Lai, R.W.F., Nguyen, N.K., Osadnik, M.: RoK and roll - verifier-efficient random projection for $$\\tilde{O}(\\lambda )$$-size lattice arguments - (extended abstract). In: Hanaoka, G., Yang, B.Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02025, Part\u00a0III. Lecture Notes in Computer Science, vol. 16247, pp. 297\u2013329. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-981-95-5099-9_10","DOI":"10.1007\/978-981-95-5099-9_10"},{"key":"17_CR49","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0IV. Lecture Notes in Computer Science, vol. 14084, pp. 669\u2013701. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_21","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"17_CR50","unstructured":"Kothapalli, A., Setty, S.: SuperNova: Proving universal machine executions without universal circuits. Cryptology ePrint Archive (2022)"},{"key":"17_CR51","unstructured":"Kothapalli, A., Setty, S.: Cyclefold: Folding-scheme-based recursive arguments over a cycle of elliptic curves. Cryptology ePrint Archive, Paper 2023\/1192 (2023). https:\/\/eprint.iacr.org\/2023\/1192"},{"key":"17_CR52","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.: HyperNova: Recursive Arguments for Customizable Constraint Systems. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024. CRYPTO 2024. Lecture Notes in Computer Science, vol 14929. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"17_CR53","unstructured":"Kothapalli, A., Setty, S.: NeutronNova: Folding everything that reduces to zero-check. Cryptology ePrint Archive (2024)"},{"key":"17_CR54","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.) Advances in Cryptology \u2013 CRYPTO 2022. CRYPTO 2022. Lecture Notes in Computer Science, 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"},{"key":"17_CR55","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.T.V.: HyperNova: Recursive arguments for customizable constraint systems. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0X. Lecture Notes in Computer Science, vol. 14929, pp. 345\u2013379. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"17_CR56","unstructured":"Kuriyama, S., Lai, R., Osadnik, M., Tucci, L.: Salsaa - sumcheck-aided lattice-based succinct arguments and applications. Cryptology ePrint Archive, Paper 2025\/2124 (2025). https:\/\/eprint.iacr.org\/2025\/2124"},{"key":"17_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-48965-0_8","volume-title":"Cryptology and Network Security","author":"P Longa","year":"2016","unstructured":"Longa, P., Naehrig, M.: Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 124\u2013139. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_8"},{"key":"17_CR58","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. In: FOCS (1990)"},{"key":"17_CR59","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"17_CR60","unstructured":"Micali, S.: CS proofs. In: FOCS (1994)"},{"key":"17_CR61","unstructured":"Nethermind Research: Lattice-based operations performance report (2025). https:\/\/nethermind.notion.site\/Latticefold-and-lattice-based-operations-performance-report-153360fc38d080ac930cdeeffed69559"},{"key":"17_CR62","unstructured":"Nguyen, N.K., O\u2019Rourk, G., Zhang, J.: Hachi: Efficient lattice-based multilinear polynomial commitments over extension fields. Cryptology ePrint Archive, Paper 2026\/156 (2026). https:\/\/eprint.iacr.org\/2026\/156"},{"key":"17_CR63","doi-asserted-by":"publisher","unstructured":"Nguyen, N.K., Seiler, G.: Greyhound: Fast polynomial commitments from lattices. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0X. Lecture Notes in Computer Science, 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_CR64","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). https:\/\/eprint.iacr.org\/2025\/294"},{"key":"17_CR65","unstructured":"Nguyen, W., Setty, S.: Neo and superneo: Post-quantum folding with pay-per-bit costs over small fields. Cryptology ePrint Archive (2026)"},{"key":"17_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-38348-9_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming Authenticated Data Structures. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 353\u2013370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_22"},{"key":"17_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"17_CR68","unstructured":"Polygon Zero Team: Plonky2: Fast recursive arguments with PLONK and FRI (2022). https:\/\/docs.rs\/crate\/plonky2\/latest\/source\/plonky2.pdf"},{"key":"17_CR69","doi-asserted-by":"crossref","unstructured":"Regev, O.: Lattice-based cryptography. In: Annual International Cryptology Conference. pp. 131\u2013141. Springer, Cham (2006)","DOI":"10.1007\/11818175_8"},{"key":"17_CR70","unstructured":"Seiler, G.: Faster avx2 optimized ntt multiplication for ring-lwe lattice cryptography. Cryptology ePrint Archive (2018)"},{"key":"17_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Setty","year":"2020","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"},{"key":"17_CR72","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive (2023)"},{"key":"17_CR73","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 26, 1484\u20131509 (1997)","DOI":"10.1137\/S0097539795293172"},{"key":"17_CR74","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: TCC, pp. 552\u2013576 (2008)"},{"key":"17_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.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0X. Lecture Notes in Computer Science, 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"},{"key":"17_CR76","doi-asserted-by":"publisher","unstructured":"Zhao, J., Setty, S.T.V., Cui, W., Zaverucha, G.: MicroNova: Folding-based arguments with efficient (on-chain) verification. In: Blanton, M., Enck, W., Nita-Rotaru, C. (eds.) 2025 IEEE Symposium on Security and Privacy, pp. 1964\u20131982. IEEE Computer Society Press, San Francisco, CA, USA (2025). https:\/\/doi.org\/10.1109\/SP61157.2025.00168","DOI":"10.1109\/SP61157.2025.00168"},{"key":"17_CR77","unstructured":"Zhou, Z., Zhang, Z., Dong, J.: Proof-carrying data from multi-folding schemes. Cryptology ePrint Archive, Paper 2023\/1282 (2023)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35424-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T12:59:53Z","timestamp":1786366793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35424-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354266","9783032354242"],"references-count":77,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35424-2_17","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":"11 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}