{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:14:39Z","timestamp":1778087679143,"version":"3.51.4"},"publisher-location":"Cham","reference-count":50,"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_4","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:36:14Z","timestamp":1778085374000},"page":"92-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the\u00a0Shortest Vector Problem in\u00a0$$2^{0.63269n+o(n)}$$ Time on\u00a0Random Lattices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2549-951X","authenticated-orcid":false,"given":"Amaury","family":"Pouly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8657-9337","authenticated-orcid":false,"given":"Yixin","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Chen, Y., Kumar, R., Shen, Y.: Improved (provable) algorithms for the shortest vector problem via bounded distance decoding. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16\u201319 March 2021, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol.\u00a0187, pp. 4:1\u20134:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.4","DOI":"10.4230\/LIPIcs.STACS.2021.4"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in 2$$ ^{\\text{n}}$$ time using discrete gaussian sampling: Extended abstract. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 733\u2013742. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746606","DOI":"10.1145\/2746539.2746606"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-030-56880-1_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Aggarwal","year":"2020","unstructured":"Aggarwal, D., Li, J., Nguyen, P.Q., Stephens-Davidowitz, N.: Slide reduction, revisited\u2014filling the gaps in SVP approximation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 274\u2013295. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_10"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-77870-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"D Aggarwal","year":"2021","unstructured":"Aggarwal, D., Li, Z., Stephens-Davidowitz, N.: A $$2^{n\/2}$$-time algorithm for $$\\sqrt{n}$$-SVP and $$\\sqrt{n}$$-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 467\u2013497. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_17"},{"key":"4_CR5","unstructured":"Aggarwal, D., Ursu, B., Vaudenay, S.: Faster sieving algorithm for approximate SVP with constant approximation factors. Cryptology ePrint Archive, Paper 2019\/1028 (2019). https:\/\/eprint.iacr.org\/2019\/1028"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 10\u201319. Association for Computing Machinery, New York, NY, USA (1998). https:\/\/doi.org\/10.1145\/276698.276705","DOI":"10.1145\/276698.276705"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-030-84245-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Bai, S., Li, J., Rowell, J.: Lattice reduction with approximate enumeration oracles. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 732\u2013759. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_25"},{"key":"4_CR8","unstructured":"Aono, Y., Espitau, T., Nguyen, P.Q.: Random lattices: theory and practice. https:\/\/api.semanticscholar.org\/CorpusID:271090054"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Bambury, H., Nguyen, P.Q.: Improved provable reduction of NTRU and hypercubic lattices. In: Post-Quantum Cryptography, PQCrypto 2024, Part I, pp. 343\u2013370. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_12","DOI":"10.1007\/978-3-031-62743-9_12"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 10\u201324. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.CH2","DOI":"10.1137\/1.9781611974331.CH2"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-031-30589-4_9","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"H Bennett","year":"2023","unstructured":"Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of $$\\mathbb{Z} ^n$$? Algorithms and cryptography with the simplest lattice. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023, pp. 252\u2013281. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_9"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Bos, J., et al.: Crystals - kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS&P), pp. 353\u2013367 (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 575\u2013584. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS 2014, pp. 1\u201312. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2554797.2554799","DOI":"10.1145\/2554797.2554799"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-39568-7_27","volume-title":"Advances in Cryptology","author":"EF Brickell","year":"1985","unstructured":"Brickell, E.F.: Breaking iterated knapsacks. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 342\u2013358. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_27"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"de\u00a0Buda, R.: Some optimal codes have structure. IEEE J. Sel. Areas Commun. 7(6), 893\u2013899 (1989). https:\/\/doi.org\/10.1109\/49.29612","DOI":"10.1109\/49.29612"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Chuengsatiansup, C., Prest, T., Stehl\u00e9, D., Wallet, A., Xagawa, K.: Modfalcon: compact signatures based on module-NTRU lattices. In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, ASIA CCS 2020, pp. 853\u2013866. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3320269.3384758","DOI":"10.1145\/3320269.3384758"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Dadush, D., Liu, F.H., Peikert, C.: On the lattice smoothing parameter problem. In: 2013 IEEE Conference on Computational Complexity, pp. 230\u2013241 (2013). https:\/\/doi.org\/10.1109\/CCC.2013.31","DOI":"10.1109\/CCC.2013.31"},{"key":"4_CR19","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.) Advances in Cryptology - EUROCRYPT 2022, Part III. 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":"4_CR20","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: Crystals-dilithium: a lattice-based digital signature scheme. Trans. Cryptogr. Hardw. Embed. Syst. 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":"4_CR21","unstructured":"Fouque, P.A., et al.: Falcon: fast-fourier lattice-based compact signatures over NTRU (2019). https:\/\/api.semanticscholar.org\/CorpusID:231637439"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987). https:\/\/doi.org\/10.1007\/BF02579200","DOI":"10.1007\/BF02579200"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within mordell\u2019s inequality. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 207\u2013216. Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1374376.1374408","DOI":"10.1145\/1374376.1374408"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 197\u2013206. Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Lenstra Jr, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","DOI":"10.1287\/moor.8.4.538"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987). https:\/\/doi.org\/10.1287\/moor.12.3.415","DOI":"10.1287\/moor.12.3.415"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12830","volume":"109","author":"S Kim","year":"2024","unstructured":"Kim, S.: Adelic rogers integral formula. J. Lond. Math. Soc. 109(1), e12830 (2024). https:\/\/doi.org\/10.1112\/jlms.12830","journal-title":"J. Lond. Math. Soc."},{"key":"4_CR28","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. Des. Codes Cryptogr. 88(5), 931\u2013950 (2020). https:\/\/doi.org\/10.1007\/S10623-020-00719-W","DOI":"10.1007\/S10623-020-00719-W"},{"key":"4_CR29","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 937\u2013941. Society for Industrial and Applied Mathematics, USA (2000)"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM 32(1), 229\u2013246 (1985). https:\/\/doi.org\/10.1145\/2455.2461","DOI":"10.1145\/2455.2461"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"4_CR32","unstructured":"Li, J.: Provable speedups for SVP approximation under random local blocks. Cryptology ePrint Archive, Paper 2025\/244 (2025). https:\/\/eprint.iacr.org\/2025\/244"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Li, J., Nguyen, P.Q.: A complete analysis of the BKZ lattice reduction algorithm. J. Cryptol. 38(1) (2024). https:\/\/doi.org\/10.1007\/s00145-024-09527-0","DOI":"10.1007\/s00145-024-09527-0"},{"issue":"10","key":"4_CR34","doi-asserted-by":"publisher","first-page":"6399","DOI":"10.1109\/TIT.2014.2343226","volume":"60","author":"C Ling","year":"2014","unstructured":"Ling, C., Luzzi, L., Belfiore, J.C., Stehl\u00e9, D.: Semantically secure lattice codes for the gaussian wiretap channel. IEEE Trans. Inf. Theory 60(10), 6399\u20136416 (2014). https:\/\/doi.org\/10.1109\/TIT.2014.2343226","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","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). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"issue":"2","key":"4_CR36","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1017\/S0305004100033302","volume":"54","author":"AM Macbeath","year":"1958","unstructured":"Macbeath, A.M., Rogers, C.A.: Siegel\u2019s mean value theorem in the geometry of numbers. Math. Proc. Cambridge Philos. Soc. 54(2), 139\u2013151 (1958). https:\/\/doi.org\/10.1017\/S0305004100033302","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"4_CR37","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"Pouly, A., Shen, Y.: Provable dual attacks on learning with errors. In: Advances in Cryptology \u2013 EUROCRYPT 2024, Part VII, pp. 256\u2013285. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_10","DOI":"10.1007\/978-3-031-58754-2_10"},{"key":"4_CR39","unstructured":"Pouly, A., Shen, Y.: Solving SIS in any norm via gaussian sampling. Cryptology ePrint Archive, Paper 2026\/225 (2026). https:\/\/eprint.iacr.org\/2026\/225"},{"issue":"1","key":"4_CR40","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2307\/2308012","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on stirling\u2019s formula. Am. Math. Mon. 62(1), 26\u201329 (1955). https:\/\/doi.org\/10.2307\/2308012","journal-title":"Am. Math. Mon."},{"key":"4_CR41","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF02392493","volume":"94","author":"CA Rogers","year":"1955","unstructured":"Rogers, C.A.: Mean values over the space of lattices. Acta Math. 94, 249\u2013287 (1955). https:\/\/doi.org\/10.1007\/BF02392493","journal-title":"Acta Math."},{"key":"4_CR42","doi-asserted-by":"publisher","unstructured":"Rogers, C.A.: The number of lattice points in a set. Proc. London Math. Soc. s3-6(2), 305\u2013320 (1956). https:\/\/doi.org\/10.1112\/plms\/s3-6.2.305","DOI":"10.1112\/plms\/s3-6.2.305"},{"key":"4_CR43","doi-asserted-by":"publisher","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53(2), 201\u2013224 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90064-8. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397587900648","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"4_CR44","doi-asserted-by":"publisher","unstructured":"Shamir, A.: A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. IEEE Trans. Inf. Theory 30(5), 699\u2013704 (1984). https:\/\/doi.org\/10.1109\/TIT.1984.1056964","DOI":"10.1109\/TIT.1984.1056964"},{"key":"4_CR45","doi-asserted-by":"publisher","unstructured":"Siegel, C.L.: A mean value theorem in geometry of numbers. Ann. Math. 46(2), 340 (1945). https:\/\/doi.org\/10.2307\/1969027. https:\/\/www.jstor.org\/stable\/1969027?origin=crossref","DOI":"10.2307\/1969027"},{"key":"4_CR46","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":"4_CR47","unstructured":"Stephens-Davidowitz, N.: On the Gaussian measure over lattices. Ph.d. thesis, New York University (2017)"},{"issue":"6","key":"4_CR48","doi-asserted-by":"publisher","first-page":"3630","DOI":"10.1109\/TIT.2019.2901497","volume":"65","author":"Z Wang","year":"2019","unstructured":"Wang, Z., Ling, C.: Lattice gaussian sampling by Markov chain Monte Carlo: bounded distance decoding and trapdoor sampling. IEEE Trans. Inf. Theory 65(6), 3630\u20133645 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2901497","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-16715-2_13","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"W Wei","year":"2015","unstructured":"Wei, W., Liu, M., Wang, X.: Finding shortest lattice vectors in the presence of gaps. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 239\u2013257. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_13"},{"key":"4_CR50","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-981-96-0894-2_13","volume-title":"Advances in Cryptology - ASIACRYPT 2024","author":"W van Woerden","year":"2025","unstructured":"van Woerden, W.: Dense and smooth lattices in any genus. In: Chung, K.M., Sasaki, Y. (eds.) Advances in Cryptology - ASIACRYPT 2024, pp. 386\u2013417. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_13"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:36:19Z","timestamp":1778085379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25327-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253262","9783032253279"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25327-9_4","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"}}]}}