{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:08:06Z","timestamp":1764936486481},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557282","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T04:17:12Z","timestamp":1215577032000},"source":"Crossref","is-referenced-by-count":91,"title":["Random Linear Network Coding: A free cipher?"],"prefix":"10.1109","author":[{"given":"Luisa","family":"Lima","sequence":"first","affiliation":[]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[]},{"given":"Joao","family":"Barros","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Byzantine modification detection in multicast networks using randomized network coding","author":"ho","year":"2003","journal-title":"Proceedings of the International Symposium on Information Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523584"},{"key":"ref12","article-title":"Resilient Network Coding In the Presence of Byzantine Adversaries","author":"jaggi","year":"2006","journal-title":"IEEE INFOCOM"},{"key":"ref13","author":"jaggi","year":"2005","journal-title":"Design and Analysis of Network Codes"},{"key":"ref14","article-title":"Secure Network Coding with a Cost Criterion","author":"tan","year":"2006","journal-title":"Proc 4th Int Symp Modeling and Optimization in Mobile Ad Hoc and Wireless Networks (WiOpt)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref4","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc of The 42nd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref3","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proceedings of the IEEE International Symposium on Information Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2004.1269720"},{"key":"ref5","article-title":"Weakly secure network coding","author":"bhattad","year":"2005","journal-title":"Proc of the First Workshop on Network Coding Theory and Applications (NetCod)"},{"key":"ref8","article-title":"On randomized network coding","author":"ho","year":"2003","journal-title":"Proceedings of the 41st Annual Allerton Conference on Communication Control and Computing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","article-title":"On Coding for Reliable Communication over Packet Networks","author":"lun","year":"2005","journal-title":"Arxiv preprint cs IT\/0511100"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","location":"Nice","start":{"date-parts":[[2007,6,24]]},"end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557282.pdf?arnumber=4557282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T17:06:50Z","timestamp":1489684010000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557282\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2007.4557282","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}