{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:14:05Z","timestamp":1771611245306,"version":"3.50.1"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Israeli MOITAL NEPTUN consortium"},{"name":"European Union Horizon 2020 Research and Innovation Programme SUPERFLUIDITY","award":["671566"],"award-info":[{"award-number":["671566"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tcomm.2018.2870831","type":"journal-article","created":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T18:31:03Z","timestamp":1537209063000},"page":"708-723","source":"Crossref","is-referenced-by-count":20,"title":["Secure Multi-Source Multicast"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5664-2518","authenticated-orcid":false,"given":"Alejandro","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9567-5793","authenticated-orcid":false,"given":"Asaf","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Gurewitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref71","year":"2017","journal-title":"The Internet Can Be a Scary Place for Your Live Video Don’t Let a Bad Stream Cost you Your Audiences"},{"key":"ref70","year":"2017","journal-title":"Live Cellular Uplinking for Television and the Web"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977985"},{"key":"ref38","article-title":"Secure network coding via filtered secret sharing","author":"feldman","year":"2004","journal-title":"Proc 42nd Annu Allerton Conf"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2384293"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2015.7227061"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993676"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523338"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892324"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref60","first-page":"1","article-title":"Efficient operation of wireless packet networks using network coding","volume":"5","author":"lun","year":"2005","journal-title":"Proc IWCT"},{"key":"ref62","author":"popa","year":"2011","journal-title":"Going beyond pollution attacks Forcing byzantine clients to code correctly"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111202"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.03.010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874532"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176795"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158587"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2008.01.006"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2015.7263352"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570836"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875056"},{"key":"ref69","first-page":"165","article-title":"Ranks of completions of partial matrices","author":"cohen","year":"1989","journal-title":"The Gohberg Anniversary Collection"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref20","first-page":"350","article-title":"On secure communication over the multiple access channel","author":"chen","year":"2016","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557282"},{"key":"ref21","first-page":"104","article-title":"Weakly secure network coding","author":"bhattad","year":"2005","journal-title":"Proc NetCod"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2014.6892130"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2704110"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICUMT.2016.7765364"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028489"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989438"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2014.6881204"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089559"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033713"},{"key":"ref56","first-page":"1","article-title":"How good is random linear coding based distributed networked storage","author":"acedanski","year":"2005","journal-title":"Proc Workshop Netw Coding Theory Appl"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.147"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206009"},{"key":"ref11","first-page":"413","article-title":"Valuable messages and random outputs of channels in linear network coding","author":"cai","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2094592"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334291"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2282673"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970867"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282675"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248979"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2566260"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421192"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/AUSCTW.2008.4460828"},{"key":"ref3","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090197"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173631"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557284"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref45","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945450"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282638"},{"key":"ref41","doi-asserted-by":"crossref","DOI":"10.1201\/b15496","author":"zhou","year":"2016","journal-title":"Physical Layer Security in Wireless Communications"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694012"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8612982\/08466890.pdf?arnumber=8466890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:47:26Z","timestamp":1657745246000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8466890\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":71,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2870831","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}