{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T05:10:31Z","timestamp":1744953031466,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/netcod.2013.6570834","type":"proceedings-article","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T15:40:54Z","timestamp":1376494854000},"page":"1-6","source":"Crossref","is-referenced-by-count":7,"title":["Routing for security in networks with adversarial nodes"],"prefix":"10.1109","author":[{"given":"Pak Hou","family":"Che","sequence":"first","affiliation":[]},{"given":"Minghua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Tracey","family":"Ho","sequence":"additional","affiliation":[]},{"given":"Sidharth","family":"Jaggi","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570834"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2010.5487669"},{"key":"13","article-title":"On linear network coding","author":"jaggi","year":"0","journal-title":"2004 Invited Talk 42nd Annual Allerton Conference on Communication Control and Computing"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523584"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"2","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc 42nd Annu Allerton Conf Communication Control and Computing"},{"key":"1","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc 2002 IEEE Int Symp Information Theory (ISIT 2002)"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394912"},{"key":"7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4310\/CIS.2006.v6.n1.a3","article-title":"Network error correction, part II: Lower bounds","volume":"6","author":"cai","year":"2006","journal-title":"Commun Inf Syst"},{"key":"6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4310\/CIS.2006.v6.n1.a2","article-title":"Network error correction, part I: Basic concepts and upper bounds","volume":"6","author":"yeung","year":"2006","journal-title":"Commun Inf Syst"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454118"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173631"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921711"}],"event":{"name":"2013 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2013,6,7]]},"location":"Calgary, AB, Canada","end":{"date-parts":[[2013,6,9]]}},"container-title":["2013 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6560497\/6570811\/06570834.pdf?arnumber=6570834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T19:33:39Z","timestamp":1646336019000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6570834\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/netcod.2013.6570834","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}