{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:05Z","timestamp":1778087585879,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253262","type":"print"},{"value":"9783032253279","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-25327-9_5","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:28:42Z","timestamp":1778084922000},"page":"124-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Gaussian Leftover Hash Lemma for\u00a0Modules over\u00a0Number Fields"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0093-4578","authenticated-orcid":false,"given":"Martin R.","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2161-2498","authenticated-orcid":false,"given":"Jo\u00ebl","family":"Felderhoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9126-1887","authenticated-orcid":false,"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5089-989X","authenticated-orcid":false,"given":"Oleksandra","family":"Lapiha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8905-1207","authenticated-orcid":false,"given":"Ivy K. Y.","family":"Woo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"5_CR1","unstructured":"Aggarwal, D., Regev, O.: A note on discrete gaussian combinations of lattice vectors. Chicago J. Theor. Comput. Sci. (2016)"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Gentry, C., Halevi, S., Sahai, A.: Discrete Gaussian leftover hash lemma over infinite domains. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT\u00a02013, Part\u00a0I. LNCS, vol.\u00a08269, pp. 97\u2013116. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_6","DOI":"10.1007\/978-3-642-42033-7_6"},{"key":"5_CR3","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\u00a02022, Part\u00a0II. 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":"5_CR4","unstructured":"Albrecht, M.R., Felderhoff, J., Lai, R.W.F., Lapiha, O., Woo, I.K.Y.: A gaussian leftover hash lemma for modules over number fields. Cryptology ePrint Archive, Paper 2025\/1852 (2025). https:\/\/eprint.iacr.org\/2025\/1852"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Lai, R.W.F., Lapiha, O., Woo, I.K.Y.: Partial lattice trapdoors: how to split lattice trapdoors, literally. In: Hanaoka, G., Yang, B.Y. (eds.) ASIACRYPT\u00a02025, Part\u00a0III. LNCS, vol. 16247, pp. 265\u2013296. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-95-5099-9_9","DOI":"10.1007\/978-981-95-5099-9_9"},{"key":"5_CR6","unstructured":"Bach, E., Shallit, J.O.: Algorithmic Number Theory: Efficient Algorithms. MIT Press (1996)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19379-8_1","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 1\u201316. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_1"},{"key":"5_CR9","unstructured":"Boudgoust, K., Lapiha, O.: Leftover hash lemma(s) over cyclotomic rings. Cryptology ePrint Archive, Paper 2025\/1080 (2025). https:\/\/eprint.iacr.org\/2025\/1080"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-662-53008-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"F Bourse","year":"2016","unstructured":"Bourse, F., Del Pino, R., Minelli, M., Wee, H.: FHE circuit privacy almost for free. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 62\u201389. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_3"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, H.: Algorithms for algebraic number theory. In: A Course in Computational Algebraic Number Theory. Springer (1993)","DOI":"10.1007\/978-3-662-02945-9"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-49896-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Cramer","year":"2016","unstructured":"Cramer, R., Ducas, L., Peikert, C., Regev, O.: Recovering short generators of principal ideals in cyclotomic rings. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 559\u2013585. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Felderhoff, J., Pellet-Mary, A., Stehl\u00e9, D.: On module unique-SVP and NTRU. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13793, pp. 709\u2013740. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_24","DOI":"10.1007\/978-3-031-22969-5_24"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-030-45374-9_21","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"N Genise","year":"2020","unstructured":"Genise, N., Micciancio, D., Peikert, C., Walter, M.: Improved discrete gaussian and subgaussian analysis for lattice cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 623\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_21"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Jin, H., Liu, F.H., Wang, Z., Gu, D.: Discrete gaussians modulo sub-lattices: new leftover hash lemmas for discrete gaussians. In: Jager, T., Pan, J. (eds.) PKC\u00a02025, Part\u00a0II. LNCS, vol. 15675, pp. 301\u2013330. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91823-0_10","DOI":"10.1007\/978-3-031-91823-0_10"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Kirshanova, E., Nguyen, H., Stehl\u00e9, D., Wallet, A.: On the smoothing parameter and last minimum of random orthogonal lattices. DCC 88(5), 931\u2013950 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00719-w","DOI":"10.1007\/s10623-020-00719-w"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-55220-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D., Steinfeld, R.: GGHLite: more efficient multilinear maps from ideal lattices. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 239\u2013256. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_14"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Laurent, B., Massart, P.: Adaptive estimation of a quadratic functional by model selection. Ann. Stat. 28(5), 1302\u20131338 (2000). https:\/\/doi.org\/10.1214\/aos\/1015957395","DOI":"10.1214\/aos\/1015957395"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-662-44371-2_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Ling","year":"2014","unstructured":"Ling, S., Phan, D.H., Stehl\u00e9, D., Steinfeld, R.: Hardness of k-LWE and applications in traitor tracing. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 315\u2013334. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_18"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective, vol.\u00a0671. Springer (2002)","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-40041-4_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with small parameters. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 21\u201339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_2"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"5_CR23","unstructured":"Neukirch, J.: Algebraic Number Theory, vol.\u00a0322. Springer (2013)"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Nguyen, H.H., Paquette, E.: Surjectivity of near-square random matrices. Comb. Probab. Comput. 29(2), 267\u2013292 (2020). https:\/\/doi.org\/10.1017\/S0963548319000348","DOI":"10.1017\/S0963548319000348"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92062-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"A Pellet-Mary","year":"2021","unstructured":"Pellet-Mary, A., Stehl\u00e9, D.: On the hardness of the NTRU problem. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 3\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_1"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Silverstein, J.W.: The smallest eigenvalue of a large dimensional wishart matrix. Ann. Probab. 13(4) (1985). https:\/\/doi.org\/10.1214\/aop\/1176992819","DOI":"10.1214\/aop\/1176992819"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT\u00a02011. LNCS, vol.\u00a06632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"5_CR28","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRUEncrypt and NTRUSign as secure as standard worst-case problems over ideal lattices. Cryptology ePrint Archive, Report 2013\/004 (2013). https:\/\/eprint.iacr.org\/2013\/004"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25327-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:28:46Z","timestamp":1778084926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25327-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253262","9783032253279"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25327-9_5","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":"7 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","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":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}