{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:01:02Z","timestamp":1770742862965,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":46,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608935","type":"print"},{"value":"9789819608942","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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-981-96-0894-2_10","type":"book-chapter","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:48:09Z","timestamp":1734050889000},"page":"303-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Lova: Lattice-Based Folding Scheme from\u00a0Unstructured Lattices"],"prefix":"10.1007","author":[{"given":"Giacomo","family":"Fenzi","sequence":"first","affiliation":[]},{"given":"Christian","family":"Knabenhans","sequence":"additional","affiliation":[]},{"given":"Ngoc Khanh","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Duc Tu","family":"Pham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Boneh, and X. Boyen. \u201cEfficient Lattice (H)IBE in the Standard Model\u201d. In: EUROCRYPT. 2010, pp. 553-572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"T. Attema, R. Cramer, and L. Kohl. \u201cA Compressed $$\\Sigma $$-Protocol Theory for Lattices\u201d. In: CRYPTO (2). Vol. 12826. Lecture Notes in Computer Science. Springer, 2021, pp. 549-579","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"M. Ajtai. \u201cGenerating Hard Instances of Lattice Problems (Extended Abstract)\u201d. In: STOC. 1996, pp. 99-108","DOI":"10.1145\/237814.237838"},{"key":"10_CR4","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":"10_CR5","unstructured":"T. Attema. \u201cCompressed Sigma-Protocol Theory\u201d. PhD thesis. CWI and TNO, 2023. URL: https:\/\/hdl.handle.net\/1887\/3619596"},{"key":"10_CR6","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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-319-96881-0_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Baum","year":"2018","unstructured":"Baum, C., Bootle, J., Cerulli, A., del Pino, R., Groth, J., Lyubashevsky, V.: Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 669\u2013699. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_23"},{"key":"10_CR8","unstructured":"B. B\u00fcnz and B. Chen. ProtoStar: Generic Efficient Accumulation\/ Folding for Special Sound Protocols. Cryptology ePrint Archive, Paper 2023\/620. https:\/\/eprint.iacr.org\/2023\/620 2023. URL:https:\/\/eprint.iacr.org\/2023\/620"},{"key":"10_CR9","unstructured":"D. Boneh and B. Chen. LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems. Cryptology ePrint Archive, Paper 2024\/257. https:\/\/eprint.iacr.org\/2024\/257 Last accessed: 19.05.2024. 2024. URL: https:\/\/eprint.iacr.org\/ 2024\/257"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. \u201cRecursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data\u201d. In: Proceedings of the 45th ACM Symposium on the Theory of Computing. STOC \u201913. 2013, pp. 111-120","DOI":"10.1145\/2488608.2488623"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"B. B\u00fcnz, A. Chiesa, W. Lin, P. Mishra, and N. Spooner. \u201cProof- Carrying Data Without Succinct Arguments\u201d. In: CRYPTO (1). Vol. 12825. Lecture Notes in Computer Science. Springer, 2021, pp. 681-710","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"10_CR12","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":"10_CR13","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"},{"key":"10_CR14","unstructured":"S. Bowe, J. Grigg, and D. Hopwood. Halo2. 2019. URL: https:\/\/github.com\/zcash\/halo2"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-56880-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Bootle","year":"2020","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 441\u2013469. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_16"},{"key":"10_CR16","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":"10_CR17","unstructured":"J. Bonneau, I. Meckler, V. Rao, and E. Shapiro. Coda: Decentralized Cryptocurrency at Scale. Cryptology ePrint Archive, Paper 2020\/352. https:\/\/eprint.iacr.org\/2020\/352.2020 URL: https:\/\/eprint.iacr.org\/2020\/352"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-38554-4_17","volume":"14085","author":"W Beullens","year":"2023","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: Compact Proofs for R1CS from Module-SIS. Lecture Notes in Computer Science 14085, 518\u2013548 (2023)","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR19","unstructured":"V. Cini, G. Malavolta, N. K. Nguyen, and H. Wee. Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup. Cryptology ePrint Archive, Paper 2024\/281. https:\/\/eprint.iacr.org\/2024\/281.2024 URL: https:\/\/eprint.iacr.org\/2024\/281"},{"key":"10_CR20","unstructured":"A. Chiesa and E. Tromer. \u201cProof-Carrying Data and Hearsay Arguments from Signature Cards\u201d. In: Proceedings of the 1st Symposium on Innovations in Computer Science. ICS \u201910. 2010, pp. 310-331"},{"key":"10_CR21","unstructured":"I. Damg\u00e5rd. On $$\\sigma Protocols$$. http:\/\/www.cs.au.dk\/ivan\/Sigma.pdf.2010"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"R. A. DeMillo and R. J. Lipton. \u201cA Probabilistic Remark on Algebraic Program Testing\u201d. In: Information Processing Letters 7.4 (1978), pp. 193-195","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"L. Ducas, V. Lyubashevsky, and T. Prest. \u201cEfficient Identity-Based Encryption over NTRU Lattices\u201d. In: ASIACRYPT. 2014, pp. 22- 41","DOI":"10.1007\/978-3-662-45608-8_2"},{"key":"10_CR24","unstructured":"L. Eagen and A. Gabizon. ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances. Cryptology ePrint Archive, Paper 2023\/1106. https:\/\/eprint.iacr.org\/2023\/1106. 2023 URL: https:\/\/eprint.iacr.org\/2023\/1106"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"M. F. Esgin, R. Steinfeld, J. K. Liu, and D. Liu. \u201cLattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications\u201d. In: CRYPTO (1). Springer, 2019, pp. 115-146","DOI":"10.1007\/978-3-030-26948-7_5"},{"key":"10_CR26","unstructured":"M. R. Albrecht, B. Curtis, C. Yun, C. Lefebvre, F. Virdia, F. G\u00f6pfert, H. Hunt, H. Kippen, J. Owen, L. Ducas, L. Pulles, M. Schmidt, M. Walter, R. Player, and S. Scott. lattice-estimator. URL: https:\/\/github.com\/malb\/lattice-estimator"},{"key":"10_CR27","unstructured":"G. Fenzi, H. Moghaddas, and N. K. Nguyen. Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. Cryptology ePrint Archive, Paper 2023\/846. https:\/\/eprint.iacr.org\/2023\/846.2023 URL: https:\/\/eprint.iacr.org\/2023\/846"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting Lattice Reduction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"10_CR29","unstructured":"D. Khovratovich, M. Maller, and P. R. Tiwari. MinRoot: Candidate Sequential Function for Ethereum VDF. Cryptology ePrint Archive, Paper 2022\/1626. https:\/\/eprint.iacr.org\/2022\/1626.2022 URL: https:\/\/eprint.iacr.org\/2022\/1626"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"A. Kothapalli and B. Parno. \u201cAlgebraic Reductions of Knowledge\u201d. In: Advances in Cryptology - CRYPTO 2023. Ed. by H. Handschuh and A. Lysyanskaya. Cham: Springer Nature Switzerland, 2023, pp. 669-701. isbn: 978-3-031-38551-3","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"10_CR31","unstructured":"A. Kothapalli and S. Setty. SuperNova: Proving universal machine executions without universal circuits. Cryptology ePrint Archive, Paper 2022\/1758. https:\/\/eprint.iacr.org\/2022\/1758. 2022 URL: https:\/\/eprint.iacr.org\/2022\/1758"},{"key":"10_CR32","unstructured":"A. Kothapalli and S. Setty. HyperNova: Recursive arguments for customizable constraint systems. Cryptology ePrint Archive, Paper 2023\/573. https:\/\/eprint.iacr.org\/2023\/573.2023 URL: https:\/\/eprint.iacr.org\/2023\/573"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"A. Kothapalli, S. T. V. Setty, and I. Tzialla. \u201cNova: Recursive Zero-Knowledge Arguments from Folding Schemes\u201d. In: CRYPTO (4). Vol. 13510. Lecture Notes in Computer Science. Springer, 2022, pp. 359-388","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"C. Lund, L. Fortnow, H. J. Karloff, and N. Nisan. \u201cAlgebraic Methods for Interactive Proof Systems\u201d. In: Journal of the ACM 39.4 (1992), pp. 859-868","DOI":"10.1145\/146585.146605"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, N. K. Nguyen, and M. Plan\u00e7on. \u201cLattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General\u201d. In: CRYPTO (2). Vol. 13508. Lecture Notes in Computer Science. Springer, 2022, pp. 71-101","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"A. Langlois and D. Stehl\u2019e. \u201cWorst-case to average-case reductions for module lattices\u201d. In: Des. Codes Cryptogr. 75.3 (2015), pp. 565- 599","DOI":"10.1007\/s10623-014-9938-4"},{"key":"10_CR37","unstructured":"O(1) Labs. Mina cryptocurrency. 2017. URL:https:\/\/minaprotocol.com\/"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"D. Micciancio and C. Peikert. \u201cTrapdoors for Lattices: Simpler, Tighter, Faster, Smaller\u201d. In: EUROCRYPT. 2012, pp. 700-718","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"10_CR39","unstructured":"M. Orr\u2019u. nimue. URL: https:\/\/github.com\/arkworks-rs\/nimue"},{"key":"10_CR40","unstructured":"NIST. Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process. 2022. URL: https:\/\/csrc.nist.gov\/pubs\/ir\/8413\/final"},{"key":"10_CR41","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":"10_CR42","doi-asserted-by":"crossref","unstructured":"J. T. Schwartz. \u201cFast Probabilistic Algorithms for Verification of Polynomial Identities\u201d. In: Journal of the ACM 27.4 (1980), pp. 701-717","DOI":"10.1145\/322217.322225"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"P. W. Shor. \u201cAlgorithms for Quantum Computation: Discrete Logarithms and Factoring\u201d. In: FOCS. IEEE Computer Society, 1994, pp. 124-134","DOI":"10.1109\/SFCS.1994.365700"},{"key":"10_CR44","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":"10_CR45","doi-asserted-by":"crossref","unstructured":"R. Yang, M. H. Au, Z. Zhang, Q. Xu, Z. Yu, and W. Whyte. \u201cEfficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications\u201d. In: CRYPTO (1). Springer, 2019, pp. 147-175","DOI":"10.1007\/978-3-030-26948-7_6"},{"key":"10_CR46","doi-asserted-by":"publisher","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0894-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T01:04:38Z","timestamp":1734051878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0894-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819608935","9789819608942"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0894-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}