{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:16:40Z","timestamp":1648829800172},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/tit.2013.2252393","type":"journal-article","created":{"date-parts":[[2013,4,16]],"date-time":"2013-04-16T18:02:24Z","timestamp":1366135344000},"page":"4498-4509","source":"Crossref","is-referenced-by-count":3,"title":["Secure Coding Over Networks Against Noncooperative Eavesdropping"],"prefix":"10.1109","volume":"59","author":[{"given":"Jin","family":"Xu","sequence":"first","affiliation":[]},{"given":"Biao","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090197"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"ref12","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc Amer Fed Inf Proc Sot"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref15","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056816"},{"key":"ref17","author":"liang","year":"2009","journal-title":"Information Theoretic Security"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref19","author":"xu","year":"2010","journal-title":"An information theoretic approach to provably secure communications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref6","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"ref5","author":"bollobas","year":"1979","journal-title":"Graph Theory an Introductory Course"},{"key":"ref8","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Allerton Conf Commun Control Comput"},{"key":"ref7","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"IEEE Int Symp Inf Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref1","author":"levy","year":"2001","journal-title":"Crypto"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806135"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6530620\/06502716.pdf?arnumber=6502716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:45Z","timestamp":1638218865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6502716\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":20,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2252393","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}