{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:09:38Z","timestamp":1648706978207},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/USG.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1109\/tit.2013.2290992","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T18:53:35Z","timestamp":1384887215000},"page":"1126-1135","source":"Crossref","is-referenced-by-count":5,"title":["Secure Distributed Information Exchange"],"prefix":"10.1109","volume":"60","author":[{"given":"Nof","family":"Abuzainab","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Ephremides","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594968"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454907"},{"key":"ref13","first-page":"1","article-title":"Weakly secure network coding","author":"bhattad","year":"2005","journal-title":"Proc Workshop Network Coding Theory Appl"},{"key":"ref14","first-page":"1","article-title":"Secure network coding with a cost criterion","author":"tan","year":"2006","journal-title":"Proc 3rd Int Symp Modeling Optimiz Mobile Ad Hoc Wireless Netw"},{"key":"ref15","author":"olver","year":"2010","journal-title":"NIST Handbook of Mathematical Functions"},{"key":"ref4","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"yao","year":"1979","journal-title":"Proc 11th Annu ACM Symp Theory Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.144700"},{"key":"ref6","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE ISIT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref7","first-page":"1","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808684"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557284"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6714461\/06665039.pdf?arnumber=6665039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:38Z","timestamp":1642004678000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6665039\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":15,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2290992","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}