{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:50:06Z","timestamp":1770900606628,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French Agence Nationale de la Recherche through ANR JCJC COLA","doi-asserted-by":"publisher","award":["ANR-21-CE39-0011"],"award-info":[{"award-number":["ANR-21-CE39-0011"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ERC H2020","award":["74079 (ALGSTRONGCRYPTO)"],"award-info":[{"award-number":["74079 (ALGSTRONGCRYPTO)"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1109\/tit.2023.3276921","type":"journal-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T19:44:02Z","timestamp":1684266242000},"page":"6006-6027","source":"Crossref","is-referenced-by-count":12,"title":["Smoothing Codes and Lattices: Systematic Study and New Bounds"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8864-0245","authenticated-orcid":false,"given":"Thomas","family":"Debris-Alazard","sequence":"first","affiliation":[{"name":"INRIA, Paris, France"}]},{"given":"L\u00e9o","family":"Ducas","sequence":"additional","affiliation":[{"name":"Cryptology Group, Centrum Wiskunde & Informatica, Amsterdam, The Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-5631","authenticated-orcid":false,"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[{"name":"Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands"}]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[{"name":"INRIA, Paris, France"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Worst and average case hardness of decoding via smoothing bounds","author":"debris-alazard","year":"2022","journal-title":"Cryptology-eprint-archive"},{"key":"ref35","author":"wainwright","year":"2019","journal-title":"High-Dimensional Statistics A Nonasymptotic"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38548-3_2"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","article-title":"Introduction to coding theory","author":"lint","year":"1999","journal-title":"Graduate Texts in Mathematics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006839"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_16"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34578-5_2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s004400050116"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_17"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.720545"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09444-0_5"},{"key":"ref10","volume":"92","author":"chung","year":"1997","journal-title":"Spectral Graph Theory"},{"key":"ref32","first-page":"605","article-title":"Solving the shortest lattice vector problem in time 22.465 n","volume":"2009","author":"pujol","year":"2009","journal-title":"Cryptology-eprint-archive"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839479"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00152-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(98)00183-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139045520"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/SCTC"},{"key":"ref18","first-page":"1","article-title":"Bounds for packings on a sphere and in space","volume":"14","author":"kabatiansky","year":"1978","journal-title":"Problems Inf Transmiss"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343226"},{"key":"ref23","article-title":"Secret key generation from Gaussian sources using lattice-based extractors","author":"luzzi","year":"2022","journal-title":"arXiv 2206 10443"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970803"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1515\/JAA.2006.83"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.412678"},{"key":"ref21","first-page":"1299","article-title":"On bounds for packings in n-dimensional Euclidean space","volume":"245","author":"levenshtein","year":"1979","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"ref27","first-page":"114","article-title":"A public-key system based on algebraic coding theory","author":"mceliece","year":"1978"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_21"},{"key":"ref7","article-title":"On the pseudorandomness of the decoding problem via the Oracle comparison problem","author":"bombar","year":"2022","journal-title":"Cryptology-eprint-archive"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2003.157.689"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0029-x"},{"key":"ref3","first-page":"733","article-title":"Solving the shortest vector problem in 2n time using discrete Gaussian sampling","author":"aggarwal","year":"2015","journal-title":"Proc 47th Annu ACM Symp Theory Comput"},{"key":"ref6","first-page":"41","article-title":"New upper bounds for codes correcting errors","volume":"1","author":"bassalygo","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10225323\/10124926.pdf?arnumber=10124926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T18:01:39Z","timestamp":1694455299000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10124926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":38,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3276921","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9]]}}}