{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:29:14Z","timestamp":1778128154846,"version":"3.51.4"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918223","type":"print"},{"value":"9783031918230","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-031-91823-0_10","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:51:22Z","timestamp":1746593482000},"page":"301-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Discrete Gaussians Modulo Sub-Lattices: New Leftover Hash Lemmas for\u00a0Discrete Gaussians"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9111-8280","authenticated-orcid":false,"given":"Haoxiang","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4298-3925","authenticated-orcid":false,"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1741-8744","authenticated-orcid":false,"given":"Zhedong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0504-9538","authenticated-orcid":false,"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","author":"A Akavia","year":"2009","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474\u2013495. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_28"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Alwen, J., Krenn, S., Pietrzak, K., Wichs, D.: Learning with rounding, revisited - new reduction, properties and applications. In: Canetti and Garay [9], pp. 57\u201374","DOI":"10.1007\/978-3-642-40041-4_4"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02574039","volume":"13","author":"W Banaszczyk","year":"1995","unstructured":"Banaszczyk, W.: Inequalities for convex bodies and polar reciprocal lattices INRN. Discrete Comput. Geom. 13(2), 217\u2013231 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., et al.: Leftover hash lemma, revisited. In: Rogaway [42], pp. 1\u201320","DOI":"10.1007\/978-3-642-22792-9_1"},{"key":"10_CR5","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, Part II. LNCS, vol. 9815, pp. 62\u201389. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_3"},{"key":"10_CR6","unstructured":"Bourse, F., Izabach\u00e8ne, M.: Plug-and-play sanitization for TFHE. Cryptology ePrint Archive, Report 2022\/1438 (2022)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-45724-2_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Hardness of LWE on general entropic distributions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 551\u2013575. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_19"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64375-1_1","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Lossiness and entropic hardness for\u00a0ring-LWE. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 1\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_1"},{"key":"10_CR9","unstructured":"Canetti, R., Garay, J.A. (eds.): CRYPTO 2013, Part I. LNCS, vol. 8042. Springer, Heidelberg (2013)"},{"key":"10_CR10","unstructured":"Chen, Y., Hu, Z., Liu, Q., Luo, H., Tu, Y.: On the hardness of $$\\sf {{S}|{LWE}\\rangle }$$ with gaussian and other amplitudes. Cryptology ePrint Archive, Report 2023\/1498 (2023)"},{"key":"10_CR11","unstructured":"Dadush, D., Ducas, L.: Introduction, 2018. Intro to Lattice Algs and Crypto, Lecture notes. https:\/\/homepages.cwi.nl\/~dadush\/teaching\/lattices-2018\/notes\/lecture-1.pdf. Accessed 10 Apr 2024"},{"key":"10_CR12","unstructured":"Dadush, D., Ducas, L.: Periodic gaussian, discrete gaussian and transference. Intro to Lattice Algs and Crypto, Lecture notes (2018). https:\/\/homepages.cwi.nl\/~dadush\/teaching\/lattices-2018\/notes\/lecture-7.pdf. Accessed 10 Apr 2024"},{"key":"10_CR13","unstructured":"del Pino, R., et al.: Raccoon. Technical report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/raccoon-spec-web.pdf"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"del Pino, R., Katsumata, S., Prest, T., Rossi, M.: Raccoon: a masking-friendly signature proven in the probing model. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part I. LNCS, vol. 14920, pp. 409\u2013444. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-68376-3_13"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-11799-2_22","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2010","unstructured":"Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 361\u2013381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_22"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"10_CR18","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: Yao, A.C.-C. (ed.) ICS 2010, pp. 230\u2013240. Tsinghua University Press (2010)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-030-44223-1_4","volume-title":"Post-Quantum Cryptography","author":"J Howe","year":"2020","unstructured":"Howe, J., Prest, T., Ricosset, T., Rossi, M.: Isochronous gaussian sampling: from\u00a0inception to implementation. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 53\u201371. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_4"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: 21st ACM STOC, pp. 12\u201324. ACM Press (1989)","DOI":"10.1145\/73007.73009"},{"key":"10_CR21","unstructured":"Jin, H., Liu, F.-H., Wang, Z., Yu, Y., Gu, D.: Revisiting the robustness of (r\/m)LWR under polynomial moduli with applications to lattice-based compact SO-CCA security. Cryptology ePrint Archive, Paper 2024\/1696 (2024)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-662-53890-6_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Katsumata","year":"2016","unstructured":"Katsumata, S., Yamada, S.: Partitioning via non-linear polynomial functions: more compact IBEs from ideal lattices and bilinear maps. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 682\u2013712. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_23"},{"key":"10_CR23","unstructured":"Kluczniak, K.: Circuit privacy for FHEW\/TFHE-style fully homomorphic encryption in practice. Cryptology ePrint Archive, Report 2022\/1459 (2022)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-030-45374-9_22","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"Q Lai","year":"2020","unstructured":"Lai, Q., Liu, F.-H., Wang, Z.: Almost tight security in lattices with polynomial moduli \u2013 PRF, IBE, All-but-many LTF, and more. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part I. LNCS, vol. 12110, pp. 652\u2013681. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_22"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Lin, H., Wang, M., Zhuang, J., Wang, Y.: Hardness of entropic module-LWE. Theor. Comput. Sci. 999(C) (2024)","DOI":"10.1016\/j.tcs.2024.114553"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-030-56880-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"F-H Liu","year":"2020","unstructured":"Liu, F.-H., Wang, Z.: Rounding in the rings. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 296\u2013326. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_11"},{"key":"10_CR27","doi-asserted-by":"crossref","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.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: 43rd FOCS, pp. 356\u2013365. IEEE Computer Society Press (2002)","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Mol, P.: Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. In: Rogaway [42], pp. 465\u2013484","DOI":"10.1007\/978-3-642-22792-9_26"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with small parameters. In: Canetti and Garay [9], pp. 21\u201339","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: 45th FOCS, pp. 372\u2013381. IEEE Computer Society Press (2004)","DOI":"10.1109\/FOCS.2004.72"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Suhl, A.: Simulation-secure threshold PKE from LWE with polynomial modulus. CIC 1(4) (2025)","DOI":"10.62056\/a0zogy4e-"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-63715-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"D Micciancio","year":"2017","unstructured":"Micciancio, D., Walter, M.: Gaussian sampling over the integers: efficient, generic, constant-time. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 455\u2013485. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_16"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in LP norms. In: Twenty-Second Annual IEEE Conference on Computational Complexity (CCC 2007), pp. 333\u2013346 (2007)","DOI":"10.1109\/CCC.2007.12"},{"key":"10_CR37","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":"10_CR38","doi-asserted-by":"crossref","unstructured":"Peikert, C., Rosen, A.: Lattices that admit logarithmic worst-case to average-case connection factors. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 478\u2013487. ACM Press (2007)","DOI":"10.1145\/1250790.1250860"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Pino, R.D., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.-J.O.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part II. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"10_CR41","unstructured":"Renner, R., Wolf, S.: Smooth r\u00e9nyi entropy and applications. In: Proceedings of International Symposium on Information Theory, ISIT 2004, p. 233 (2004)"},{"key":"10_CR42","unstructured":"Rogaway, P. (ed.): CRYPTO 2011. LNCS, vol. 6841. Springer, Heidelberg (2011)"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-78381-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Rosca","year":"2018","unstructured":"Rosca, M., Stehl\u00e9, D., Wallet, A.: On the ring-LWE and polynomial-LWE problems. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part I. LNCS, vol. 10820, pp. 146\u2013173. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_6"},{"key":"10_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Steinfeld, R., Sakzad, A., Esgin, M.F., Kuchta, V., Yassi, M., Zhao, R.K.: Luna: quasi-optimally succinct designated-verifier zero-knowledge arguments from lattices. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, pp. 3167\u20133181. Association for Computing Machinery, New York (2024)","DOI":"10.1145\/3658644.3670345"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91823-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:51:47Z","timestamp":1746593507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91823-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918223","9783031918230"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91823-0_10","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":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}