{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:54Z","timestamp":1773377634099,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849665","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2309-2313","source":"Crossref","is-referenced-by-count":4,"title":["Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys"],"prefix":"10.1109","author":[{"given":"Debaditya","family":"Chaudhuri","sequence":"first","affiliation":[{"name":"University at Buffalo"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[{"name":"University at Buffalo"}]},{"given":"Michelle","family":"Effros","sequence":"additional","affiliation":[{"name":"California Institute of Technology"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394800"},{"key":"ref11","article-title":"On capacity region of wiretap networks","author":"jalali","year":"2012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/AUSCTW.2008.4460828"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849665"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref15","author":"fragouli","year":"2007","journal-title":"Network Coding Fundamentals"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref4","first-page":"166","article-title":"On the optimality of a construction of secure network codes","author":"cai","year":"2008","journal-title":"IEEE International Symposium on Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557284"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173631"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334291"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2820686"},{"key":"ref2","first-page":"63","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"42nd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref1","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"IEEE International Symposium on Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2216936"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849665.pdf?arnumber=8849665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:40Z","timestamp":1773347680000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849665\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849665","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}