{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:04:05Z","timestamp":1770743045605,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911002","type":"print"},{"value":"9783031911019","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-91101-9_13","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:20Z","timestamp":1745788460000},"page":"363-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hollow LWE: A New Spin"],"prefix":"10.1007","author":[{"given":"Martin R.","family":"Albrecht","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Ben\u010dina","sequence":"additional","affiliation":[]},{"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of Learning with Errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-56784-2_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Alwen","year":"2020","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Security analysis and improvements for the IETF MLS standard for group messaging. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 248\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Bardet, M., Otmani, A., Saeed-Taha, M.: Permutation code equivalence is not harder than graph isomorphism when hulls are trivial. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2464\u20132468. IEEE (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849855","DOI":"10.1109\/ISIT.2019.8849855"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-81293-5_2","volume-title":"Post-Quantum Cryptography","author":"A Barenghi","year":"2021","unstructured":"Barenghi, A., Biasse, J.-F., Persichetti, E., Santini, P.: LESS-FM: fine-tuning signatures from the code equivalence problem. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 23\u201343. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_2"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-81652-0_15","volume-title":"Selected Areas in Cryptography","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Not Enough LESS: an improved algorithm for solving code equivalence problems over $$\\mathbb{F}_q$$. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 387\u2013403. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_15"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255\u2013271. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_16"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/bf02940715","volume":"11","author":"H Chevalley","year":"1935","unstructured":"Chevalley, H., Warning, E.: Bemerkung zur vorstehenden Arbeit von Herrn Chevalley. Abh. Math. Semin. Univ. Hambg. 11(1), 76\u201383 (1935). https:\/\/doi.org\/10.1007\/bf02940715","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"key":"13_CR8","unstructured":"Chou, T., Persichetti, E., Santini, P.: On linear equivalence, canonical forms, and digital signatures. Cryptology ePrint Archive, Report 2023\/1533 (2023). https:\/\/eprint.iacr.org\/2023\/1533"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, H.: A Course in Computional Algebraic Number Theory. Springer, Heidelberg (1993). Third, Corrected Printing 1996","DOI":"10.1007\/978-3-662-02945-9_4"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Jost, D., Karthikeyan, H.: Forward-secure encryption with fast forwarding. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0II. LNCS, vol. 13748, pp. 3\u201332. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_1","DOI":"10.1007\/978-3-031-22365-5_1"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-030-90456-2_9","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2021","unstructured":"Dodis, Y., Karthikeyan, H., Wichs, D.: Updatable public key encryption in the standard model. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 254\u2013285. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_9"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Ducas, L., Gibbons, S.: Hull attacks on the lattice isomorphism problem. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 177\u2013204. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_7","DOI":"10.1007\/978-3-031-31368-4_7"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Ducas, L., van Woerden, W.P.J.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"13_CR14","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"13_CR15","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":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-17653-2_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"D Jost","year":"2019","unstructured":"Jost, D., Maurer, U., Mularczyk, M.: Efficient ratcheting: almost-optimal guarantees for secure messaging. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 159\u2013188. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_6"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"485","DOI":"10.2307\/2373389","volume":"93","author":"NM Katz","year":"1971","unstructured":"Katz, N.M.: On a theorem of ax. Am. J. Math. 93(2), 485\u2013499 (1971). https:\/\/doi.org\/10.2307\/2373389","journal-title":"Am. J. Math."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_21"},{"key":"13_CR20","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":"13_CR21","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":"13_CR22","unstructured":"Nowakowski, J.: An improved algorithm for code equivalence. Cryptology ePrint Archive, Report 2024\/1272 (2024). https:\/\/eprint.iacr.org\/2024\/1272"},{"key":"13_CR23","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"},{"issue":"6","key":"13_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","journal-title":"J. ACM"},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1137\/S0895480195294027","volume":"10","author":"N Sendrier","year":"1997","unstructured":"Sendrier, N.: On the dimension of the hull. SIAM J. Disc. Math. 10(2), 282\u2013293 (1997). https:\/\/doi.org\/10.1137\/S0895480195294027","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"13_CR26","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000). https:\/\/doi.org\/10.1109\/18.850662","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-38616-9_14","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2013","unstructured":"Sendrier, N., Simos, D.E.: The hardness of code equivalence over $$\\mathbb{F}_q$$ and its application to code-based cryptography. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 203\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_14"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91101-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:22Z","timestamp":1745788462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91101-9_13"}},"subtitle":["Unbounded Updatable Encryption from LWE and PCE"],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911002","9783031911019"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91101-9_13","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":"28 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}