{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T19:06:44Z","timestamp":1773256004946,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"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":[[2012,6]]},"DOI":"10.1109\/tit.2012.2188777","type":"journal-article","created":{"date-parts":[[2012,3,9]],"date-time":"2012-03-09T20:25:59Z","timestamp":1331324759000},"page":"3975-3988","source":"Crossref","is-referenced-by-count":60,"title":["On the Security of Index Coding With Side Information"],"prefix":"10.1109","volume":"58","author":[{"given":"Son Hoang","family":"Dau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeow Meng","family":"Chee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref30","author":"dau","year":"2011","journal-title":"Index coding and error correction"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595303"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544612"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261326"},{"key":"ref16","first-page":"276","article-title":"Minimal codewords and secret sharing","author":"massey","year":"1993","journal-title":"Proc Joint Swedish-Russian Int Workshop Inf Theory"},{"key":"ref17","first-page":"1023","article-title":"Linear multisecret-sharing schemes and error-correcting codes","volume":"3","author":"ding","year":"1997","journal-title":"J Universal Comput Sci"},{"key":"ref18","first-page":"551","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Symp Inf Theory"},{"key":"ref19","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158587"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"ref27","article-title":"Weakly secure network coding","author":"bhattad","year":"2005","journal-title":"Proc Workshop Network Coding Theory Appl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1403004"},{"key":"ref8","article-title":"The local mixing problem","author":"wu","year":"2006","journal-title":"presented at the Inf Theory Appl Workshop"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313060"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513776"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIIS.2010.24"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1478-6","author":"hedayat","year":"1999","journal-title":"Orthogonal Arrays Theory and Applications"},{"key":"ref23","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref26","first-page":"267","article-title":"An upper bound for the Shannon capacity of a graph","volume":"25","author":"haemers","year":"1978","journal-title":"Algebr Methods Graph Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6200408\/06166891.pdf?arnumber=6166891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:53Z","timestamp":1633910033000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6166891\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":32,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2188777","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}