{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T03:06:30Z","timestamp":1779419190409,"version":"3.53.1"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267306","type":"print"},{"value":"9783032267313","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-26731-3_1","type":"book-chapter","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T02:39:02Z","timestamp":1779417542000},"page":"3-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness of\u00a0M-LWE with\u00a0General Distributions and\u00a0Applications to\u00a0Leaky Variants"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3971-9368","authenticated-orcid":false,"given":"Katharina","family":"Boudgoust","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2869-3833","authenticated-orcid":false,"given":"Corentin","family":"Jeudy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2283-4829","authenticated-orcid":false,"given":"Erkan","family":"Tairi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5272-2572","authenticated-orcid":false,"given":"Weiqiang","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Libert, B., Stehl\u00e9, D.: Fully secure functional encryption for inner products, from standard assumptions. In: Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0III. LNCS, vol.\u00a09816, pp. 333\u2013362. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_12","DOI":"10.1007\/978-3-662-53015-3_12"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"1_CR3","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Report 2015\/046 (2015). https:\/\/eprint.iacr.org\/2015\/046"},{"key":"1_CR4","unstructured":"Alperin-Sheriff, J., Apon, D.: Dimension-preserving reductions from LWE to LWR. Cryptology ePrint Archive, Report 2016\/589 (2016). https:\/\/eprint.iacr.org\/2016\/589"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Alperin-Sheriff, J., Peikert, C.: Circular and KDM security for identity-based encryption. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 334\u2013352. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_20","DOI":"10.1007\/978-3-642-30057-8_20"},{"key":"1_CR6","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":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296(4), 625\u2013635 (1993)","DOI":"10.1007\/BF01445125"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Bos, J.W., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy, pp. 353\u2013367. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: Towards classical hardness of module-LWE: The linear rank case. In: Moriai, S., Wang, H. (eds.) ASIACRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12492, pp. 289\u2013317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_10","DOI":"10.1007\/978-3-030-64834-3_10"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: On the hardness of module-LWE with binary secret. In: Paterson, K.G. (ed.) CT-RSA\u00a02021. LNCS, vol. 12704, pp. 503\u2013526. Springer, Cham (2021).https:\/\/doi.org\/10.1007\/978-3-030-75539-3_21","DOI":"10.1007\/978-3-030-75539-3_21"},{"key":"1_CR12","doi-asserted-by":"publisher","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\u00a02022. LNCS, vol. 13774, pp. 78\u201399. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22912-1_4","DOI":"10.1007\/978-3-031-22912-1_4"},{"key":"1_CR13","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s00145-022-09441-3","DOI":"10.1007\/s00145-022-09441-3"},{"key":"1_CR14","unstructured":"Boudgoust, K., Jeudy, C., Tairi, E., Wen, W.: Hardness of M-LWE with general distributions and applications to leaky variants. Cryptology ePrint Archive, Report 2025\/1472 (2025). https:\/\/eprint.iacr.org\/2025\/1472"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Boudgoust, K., Keller, H.: Module learning with errors with truncated matrices. In: Niederhagen, R., Saarinen, M.J.O. (eds.) Post-Quantum Cryptography - 16th International Workshop, PQCrypto 2025, Part\u00a0I. pp. 255\u2013277. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-86599-2_9","DOI":"10.1007\/978-3-031-86599-2_9"},{"key":"1_CR16","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":"1_CR17","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Lossiness and entropic hardness for ring-LWE. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020, Part\u00a0I. LNCS, vol. 12550, pp. 1\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_1","DOI":"10.1007\/978-3-030-64375-1_1"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"1_CR19","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Chung, C.M.M., Hwang, V., Kannwischer, M.J., Seiler, G., Shih, C.J., Yang, B.Y.: NTT multiplication for NTT-unfriendly rings. IACR TCHES 2021(2), 159\u2013188 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i2.159-188, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8791","DOI":"10.46586\/tches.v2021.i2.159-188"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Del Pino, R., 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\u00a02024, Part\u00a0II. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"1_CR22","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. Cryptology ePrint Archive, Report 2003\/235 (2003). https:\/\/eprint.iacr.org\/2003\/235"},{"issue":"1","key":"1_CR23","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":"1_CR24","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Kolonelos, D., Lai, R.W.F., Lin, C., Malavolta, G., Rahimi, A.: Efficient laconic cryptography from learning with errors. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 417\u2013446. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_14","DOI":"10.1007\/978-3-031-30620-4_14"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-45724-2_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Ducas","year":"2020","unstructured":"Ducas, L., Galbraith, S., Prest, T., Yu, Y.: Integral matrix gram root and lattice Gaussian sampling without floats. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 608\u2013637. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_21"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR TCHES 2018(1), 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/839","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Espitau, T., Niot, G., Prest, T.: Flood and submerse: distributed key generation and robust threshold signature from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 425\u2013458. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_14","DOI":"10.1007\/978-3-031-68394-7_14"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Espitau, T., Wallet, A., Yu, Y.: On gaussian sampling, smoothing parameter and application to signatures. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0VII. LNCS, vol. 14444, pp. 65\u201397. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_3","DOI":"10.1007\/978-981-99-8739-9_3"},{"key":"1_CR29","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":"1_CR30","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":"1_CR31","doi-asserted-by":"publisher","unstructured":"Haidar, C.A., Passel\u00e8gue, A., Stehl\u00e9, D.: Efficient updatable public-key encryption from lattices. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14442, pp. 342\u2013373. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_11","DOI":"10.1007\/978-981-99-8733-7_11"},{"key":"1_CR32","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":"1_CR33","doi-asserted-by":"publisher","unstructured":"Kim, D., Lee, D., Seo, J., Song, Y.: Toward practical lattice-based proof of knowledge from hint-MLWE. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 549\u2013580. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18","DOI":"10.1007\/978-3-031-38554-4_18"},{"issue":"3","key":"1_CR34","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. DCC 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"DCC"},{"key":"1_CR35","unstructured":"Lin, H., Wang, M., Zhuang, J., Wang, Y.: Hardness of module-LWE and ring-LWE on general entropic distributions. Cryptology ePrint Archive, Report 2020\/1238 (2020). https:\/\/eprint.iacr.org\/2020\/1238"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K.: BLOOM: bimodal lattice one-out-of-many proofs and applications. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 95\u2013125. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_4","DOI":"10.1007\/978-3-031-22972-5_4"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-75245-3_9","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Shorter lattice-based zero-knowledge proofs via one-time commitments. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 215\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_9"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-78381-9_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"V Lyubashevsky","year":"2018","unstructured":"Lyubashevsky, V., Seiler, G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 204\u2013224. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_8"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Mera, J.M.B., Karmakar, A., Marc, T., Soleimanian, A.: Efficient lattice-based inner-product functional encryption. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022, Part\u00a0II. LNCS, vol. 13178, pp. 163\u2013193. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_6","DOI":"10.1007\/978-3-030-97131-1_6"},{"key":"1_CR41","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. Cryptology ePrint Archive, Report 2004\/286 (2004). https:\/\/eprint.iacr.org\/2004\/286"},{"key":"1_CR42","unstructured":"Micciancio, D.: On the hardness of learning with errors with binary secrets. Cryptology ePrint Archive, Report 2018\/988 (2018). https:\/\/eprint.iacr.org\/2018\/988"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-22792-9_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"D Micciancio","year":"2011","unstructured":"Micciancio, D., Mol, P.: Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 465\u2013484. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_26"},{"key":"1_CR44","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":"1_CR45","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"1_CR46","unstructured":"Micciancio, D., Suhl, A.: Simulation-secure threshold PKE from LWE with polynomial modulus. Cryptology ePrint Archive, Report 2023\/1728 (2023). https:\/\/eprint.iacr.org\/2023\/1728"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Mukherjee, A., Aikata, Mert, A.C., Lee, Y., Kwon, S., Deryabin, M., Roy, S.S.: ModHE: modular homomorphic encryption using module lattices potentials and limitations. IACR TCHES 2024(1), 527\u2013562 (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i1.527-562","DOI":"10.46586\/tches.v2024.i1.527-562"},{"key":"1_CR48","doi-asserted-by":"publisher","unstructured":"Passel\u00e8gue, A., Stehl\u00e9, D.: Low communication threshold fully homomorphic encryption. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0I. LNCS, vol. 15484, pp. 297\u2013329. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_10","DOI":"10.1007\/978-981-96-0875-1_10"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-36030-6_1","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2019","unstructured":"Peikert, C., Pepin, Z.: Algebraically structured LWE, revisited. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 1\u201323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_1"},{"key":"1_CR50","unstructured":"del Pino, R., et al.: Raccoon: A Side-Channel Secure Signature Scheme (Specifications) (2023). https:\/\/raccoonfamily.org\/wp-content\/uploads\/2023\/07\/raccoon.pdf"},{"key":"1_CR51","doi-asserted-by":"publisher","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\u00a02024, Part\u00a0I. LNCS, vol. 14920, pp. 409\u2013444. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_13","DOI":"10.1007\/978-3-031-68376-3_13"},{"key":"1_CR52","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT\u00a02009. LNCS, vol.\u00a05912, pp. 617\u2013635. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"1_CR54","doi-asserted-by":"publisher","unstructured":"Sun, C., Tibouchi, M., Abe, M.: Revisiting the hardness of binary error LWE. In: Liu, J.K., Cui, H. (eds.) ACISP 20. LNCS, vol. 12248, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_22","DOI":"10.1007\/978-3-030-55304-3_22"},{"key":"1_CR55","doi-asserted-by":"publisher","unstructured":"Wang, Z., Lai, Q., Liu, F.H.: Ring\/module learning with errors under linear leakage - hardness and applications. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024, Part\u00a0II. LNCS, vol. 14602, pp. 275\u2013304. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_9","DOI":"10.1007\/978-3-031-57722-2_9"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26731-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T02:39:08Z","timestamp":1779417548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26731-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267306","9783032267313"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26731-3_1","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":"22 May 2026","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":"West Palm Beach, FL","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":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}