{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:43:01Z","timestamp":1775144581448,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1910859"],"award-info":[{"award-number":["1910859"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517930","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"190-195","source":"Crossref","is-referenced-by-count":8,"title":["Explicit Design of Provably Covert Channel Codes"],"prefix":"10.1109","author":[{"given":"Shi-Yuan","family":"Wang","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA,USA,30332"}]},{"given":"Matthieu R.","family":"Bloch","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA,USA,30332"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2526018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511617744"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970875"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2539145"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007045"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","article-title":"How to Construct Polar Codes","volume":"59","author":"tal","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279330"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2463678"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2471179"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513567"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2879802"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110230"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878526"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437777"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2530089"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/e20010003"},{"key":"ref29","article-title":"Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity","volume":"1201","author":"bellare","year":"2012","journal-title":"ArXiv Preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955987"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849662"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2019.8885672"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2548471"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3019996"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130923"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620400"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3017212"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2368555"},{"key":"ref26","first-page":"2715","article-title":"Non-asymptotic analysis of privacy amplification via Renyi entropy and inf-spectral entropy","author":"watanabe","year":"2013","journal-title":"Proc of IEEE International Symposium on Information Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749908003256"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517930.pdf?arnumber=9517930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:38Z","timestamp":1773347738000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517930\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517930","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}