{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:53:36Z","timestamp":1773237216099,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"FP7 Project Phylaws","award":["EU FP7-ICT-317562"],"award-info":[{"award-number":["EU FP7-ICT-317562"]}]},{"name":"Royal Society International Joint Project"},{"name":"Marie Curie Fellowship (FP7\/2007-2013)","award":["PIEF-GA-2010-274765"],"award-info":[{"award-number":["PIEF-GA-2010-274765"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/tit.2014.2343226","type":"journal-article","created":{"date-parts":[[2014,7,25]],"date-time":"2014-07-25T18:42:06Z","timestamp":1406313726000},"page":"6399-6416","source":"Crossref","is-referenced-by-count":127,"title":["Semantically Secure Lattice Codes for the Gaussian Wiretap Channel"],"prefix":"10.1109","volume":"60","author":[{"given":"Cong","family":"Ling","sequence":"first","affiliation":[]},{"given":"Laura","family":"Luzzi","sequence":"additional","affiliation":[]},{"given":"Jean-Claude","family":"Belfiore","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Stehle","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.21245"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.508838"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"ref31","first-page":"2306","article-title":"Lattice codes achieving strong secrecy over the mod- \\(\\Lambda \\) Gaussian channel","author":"ling","year":"2012","journal-title":"Proc IEEE Int Symp Inform Theory (ISIT)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089376"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855591"},{"key":"ref35","first-page":"430","article-title":"On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener","author":"forney","year":"2003","journal-title":"Proc 41st Allerton Conf Commun Control Comput"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"ref10","first-page":"1","article-title":"Achievable rates for lattice coding over the Gaussian wiretap channel","author":"choo","year":"2011","journal-title":"Proc IEEE Int Conf Commun Workshops (ICC)"},{"key":"ref40","first-page":"937","article-title":"Finding the closest lattice vector when it's unusually close","author":"klein","year":"2000","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929914"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834787"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797696"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119650"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2216952"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283722"},{"key":"ref17","first-page":"641","article-title":"Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels","author":"luzzi","year":"2011","journal-title":"Proc 5th Int ICST Conf Perform Eval Methodol Tools"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184075"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620701"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.841165"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-642-32009-5_18","article-title":"Semantic security for the wiretap channel","volume":"7417","author":"bellare","year":"2012","journal-title":"Advances in Cryptology (Lecture Notes in Computer Science)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162275"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.72"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2148715"},{"key":"ref8","article-title":"Lattice codes for the wiretap Gaussian channel: Construction and analysis","author":"oggier","year":"0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2134093"},{"key":"ref2","first-page":"40","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csisz\u00e1r","year":"1996","journal-title":"Problems Inf Transmiss"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089380"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref20","article-title":"Lattice-based cryptography","author":"micciancio","year":"2008","journal-title":"Post-Quantum Cryprography"},{"key":"ref22","article-title":"Information theoretic security","author":"liang","year":"2009","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977985"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"ref24","author":"conway","year":"1998","journal-title":"Sphere Packings Lattices and Groups"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162180"},{"key":"ref23","author":"csiszar","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.641543"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165816"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.312163"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6895347\/06866169.pdf?arnumber=6866169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:51:20Z","timestamp":1642006280000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6866169\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":43,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2343226","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}