{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:40:02Z","timestamp":1742845202362,"version":"3.40.2"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","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-86599-2_9","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:10:57Z","timestamp":1742843457000},"page":"255-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Module Learning with\u00a0Errors with\u00a0Truncated Matrices"],"prefix":"10.1007","author":[{"given":"Katharina","family":"Boudgoust","sequence":"first","affiliation":[]},{"given":"Hannah","family":"Keller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bos, J.W., et al.: Frodo: take off the ring! Practical, quantum-secure key exchange from LWE. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1006\u20131018. ACM Press (2016)","DOI":"10.1145\/2976749.2978425"},{"key":"9_CR3","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. LNCS, vol. 12106, pp. 551\u2013575. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_19"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-030-64834-3_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"K Boudgoust","year":"2020","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: Towards classical hardness of\u00a0module-LWE: the linear rank case. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 289\u2013317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_10"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: Entropic hardness of module-LWE from module-NTRU. In: Isobe, T., Sarkar, S. (eds.) INDOCRYPT 2022. LNCS, vol. 13774, pp. 78\u201399. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22912-1_4"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-022-09441-3","volume":"36","author":"K Boudgoust","year":"2023","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: On the hardness of module learning with errors with short distributions. J. Cryptol. 36(1), 1 (2023)","journal-title":"J. Cryptol."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48797-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Bai","year":"2015","unstructured":"Bai, S., Langlois, A., Lepoint, T., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 3\u201324. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_1"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 575\u2013584. ACM Press (2013)","DOI":"10.1145\/2488608.2488680"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2018","unstructured":"Bai, S., Lepoint, T., Roux-Langlois, A., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. J. Cryptol. 31(2), 610\u2013640 (2018)","journal-title":"J. Cryptol."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chuengsatiansup, C., Prest, T., Stehl\u00e9, D., Wallet, A., Xagawa, K.: ModFalcon: compact signatures based on module-NTRU lattices. In: Sun, H.-M., Shieh, S.-P., Gu, G., Ateniese, G. (eds.) ASIACCS 2020, pp. 853\u2013866. ACM Press (2020)","DOI":"10.1145\/3320269.3384758"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-38348-9_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"N D\u00f6ttling","year":"2013","unstructured":"D\u00f6ttling, N., M\u00fcller-Quade, J.: Lossy codes and a new variant of the learning-with-errors problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 18\u201334. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_2"},{"key":"9_CR12","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: CRYPTO (1). Lecture Notes in Computer Science, vol. 14920, pp. 409\u2013444. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-68376-3_13"},{"key":"9_CR13","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":"9_CR14","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":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Saha, S.: A systematic study of sparse LWE. In: CRYPTO 2024, Part III. LNCS, pp. 210\u2013245 (2024)","DOI":"10.1007\/978-3-031-68382-4_7"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Jia, W., Zhang, J., Wang, B., et al.: Hardness of module-LWE with semiuniform seeds from module-NTRU. IET Inf. Secur. 2023 (2023)","DOI":"10.1049\/2023\/2969432"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kim, D., Lee, D., Seo, J., Song, Y.: Toward practical lattice-based proof of knowledge from hint-MLWE. In: CRYPTO (5). Lecture Notes in Computer Science, vol. 14085, pp. 549\u2013580. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38554-4_18"},{"key":"9_CR19","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"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"9_CR21","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":"9_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114553","volume":"999","author":"H Lin","year":"2024","unstructured":"Lin, H., Wang, M., Zhuang, J., Wang, Y.: Hardness of entropic module-LWE. Theor. Comput. Sci. 999, 114553 (2024)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a013","volume":"14","author":"D Micciancio","year":"2018","unstructured":"Micciancio, D.: On the hardness of learning with errors with binary secrets. Theory Comput. 14(1), 1\u201317 (2018)","journal-title":"Theory Comput."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Mironov, I.: R\u00e9nyi differential privacy. In: IEEE Computer Security Foundations Symposium (2017)","DOI":"10.1109\/CSF.2017.11"},{"key":"9_CR26","series-title":"LNCS","first-page":"163","volume-title":"PKC 2022, Part II","author":"JMB Mera","year":"2022","unstructured":"Mera, J.M.B., Karmakar, A., Marc, T., Soleimanian, A.: Efficient lattice-based inner-product functional encryption. In: PKC 2022, Part II. LNCS, pp. 163\u2013193. Springer, Heidelberg (2022)"},{"key":"9_CR27","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"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 372\u2013381 (2004)","DOI":"10.1109\/FOCS.2004.72"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 333\u2013342. ACM Press (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Passel\u00e8gue, A., Stehl\u00e9, D.: Low communication threshold fully homomorphic encryption. To appear in ASIACRYPT (2024)","DOI":"10.1007\/978-981-96-0875-1_10"},{"key":"9_CR31","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":"9_CR32","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"9_CR33","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. LNCS, vol. 10820, pp. 146\u2013173. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_6"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-55304-3_22","volume-title":"Information Security and Privacy","author":"C Sun","year":"2020","unstructured":"Sun, C., Tibouchi, M., Abe, M.: Revisiting the hardness of binary error LWE. In: Liu, J.K., Cui, H. (eds.) ACISP 2020. LNCS, vol. 12248, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_22"},{"issue":"7","key":"9_CR35","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"van Erven, T., Harremos, P.: R\u00e9nyi divergence and Kullback-Leibler divergence. IEEE Trans. Inf. Theory 60(7), 3797\u20133820 (2014)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86599-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:11:08Z","timestamp":1742843468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_9","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":"15 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}