{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:20:42Z","timestamp":1758273642763},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11432-010-0052-6","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T06:46:50Z","timestamp":1267426010000},"page":"648-658","source":"Crossref","is-referenced-by-count":4,"title":["Secure network coding in the presence of eavesdroppers"],"prefix":"10.1007","volume":"53","author":[{"given":"MingXing","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiXian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LiCheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XinXin","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,1]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li S-Y R, et al. Network information flow. IEEE Trans Inf Theory, 2000, 46: 1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"key":"52_CR2","doi-asserted-by":"crossref","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T. Ho","year":"2006","unstructured":"Ho T, M\u00e9dard M, Koetter R, et al. A random linear network coding approach to multicast. IEEE Trans Inf Theory, 2006, 52: 4413\u20134430","journal-title":"IEEE Trans Inf Theory"},{"key":"52_CR3","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S.-Y. R. Li","year":"2003","unstructured":"Li S-Y R, Yeung R W, Cai N. Linear network coding. IEEE Trans Inf Theory, 2003, 49: 371\u2013381","journal-title":"IEEE Trans Inf Theory"},{"key":"52_CR4","volume-title":"Information Theory and Network Coding","author":"R. W. Yeung","year":"2008","unstructured":"Yeung R W. Information Theory and Network Coding. Hong Kong: Springer, 2008"},{"key":"52_CR5","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S. Jaggi","year":"2003","unstructured":"Jaggi S, Sanders P, Chou P A, et al. Polynomial time algorithms for multicast network code construction. IEEE Trans Inf Theory, 2003, 51: 1973\u20131982","journal-title":"IEEE Trans Inf Theory"},{"key":"52_CR6","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R. Koetter","year":"2003","unstructured":"Koetter R, M\u00e9dard M. An algebraic approach to network coding. IEEE\/ACM Trans Network, 2003, 11: 782\u2013795","journal-title":"IEEE\/ACM Trans Network"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Lima L, M\u00e9dard M, Barros J. Random linear network coding: A free cypher? In: Proc of the IEEE Inter Sym on Infor Theory, Nice. 2007. 546\u2013550","DOI":"10.1109\/ISIT.2007.4557282"},{"key":"52_CR8","unstructured":"Cai N, Yeung R W. Secure network coding. In: ISIT, Switzerland, 2002. 323"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Cai N, Yeung R W. A security condition for multi-source linear network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Nice. 2007. 24\u201329","DOI":"10.1109\/ISIT.2007.4557284"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Yeung R W, Cai N. On the optimality of a construction of secure network codes. In: Proc of the IEEE Inter Sym on Infor Theory, Toronto, 2008. 166\u2013170","DOI":"10.1109\/ISIT.2008.4594969"},{"key":"52_CR11","unstructured":"Feldman J, Malkin T, Servedio R A, et al. On the capacity of secure network coding. In: 42nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2004. 388\u2013401"},{"key":"52_CR12","unstructured":"Bhattad K, Narayanan K. Weakly secure network coding. In: Proc of the First Workshop on Network Coding, Theory, and Applications (NetCod), Riva del, 2005. 148\u2013153"},{"key":"52_CR13","unstructured":"Tan J, M\u00e9dard M. Secure network coding with a cost criterion. In: Proc of the 4th Inter Sym on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt\u201906), Boston, 2006. 1\u20136"},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":"Vilela J P, Lima L, Barros J. Lightweight security for network coding. In: IEEE Inter Conference on Communications, Beijing, 2008. 1750\u20131754","DOI":"10.1109\/ICC.2008.336"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Lima L, Vilela J P, Barros J, et al. An information-theoretic cryptanalysis of network coding is protecting the code enough? In: ISITA, Auckland, 2008. 1\u20136","DOI":"10.1109\/ISITA.2008.4895420"},{"key":"52_CR16","doi-asserted-by":"crossref","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R. Koetter","year":"2008","unstructured":"Koetter R, Kschischang F. Coding for errors and erasures in random network coding. IEEE Trans Inf Theory, 2008, 54: 3579\u20133591","journal-title":"IEEE Trans Inf Theory"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Silva D, Kschischang F, Koetter R. A rank-metric approach to error control in random network coding. In: IEEE Inf Theory Workshop on Infor Theory for Wireless Networks, Tucson, 2007. 1\u20135","DOI":"10.1109\/ITWITWN.2007.4318069"},{"key":"52_CR18","doi-asserted-by":"crossref","first-page":"2596","DOI":"10.1109\/TIT.2008.921711","volume":"54","author":"S. Jaggi","year":"2008","unstructured":"Jaggi S, Langberg M, Katti S, et al. Resilient network coding in the presence of byzantine adversaries. IEEE Trans Inf Theory, 2008, 54: 2596\u20132603","journal-title":"IEEE Trans Inf Theory"},{"key":"52_CR19","unstructured":"Cai N, Yeung R W. Network coding and error ecorrection. In: Proc 2002 IEEE Inform. Bangalore, Theory Workshop, 2002. 323"},{"key":"52_CR20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4310\/CIS.2006.v6.n1.a2","volume":"6","author":"R. W. Yeung","year":"2006","unstructured":"Yeung R W, Cai N. Network error correction, I: basic concepts and upper bounds. Commun Inf Syst, 2006, 6: 19\u201335","journal-title":"Commun Inf Syst"},{"key":"52_CR21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/TIT.2007.909139","volume":"54","author":"Z. Zhang","year":"2008","unstructured":"Zhang Z. Linear network error correction coding in packet networks. IEEE Trans Inf Theory, 2008, 54: 209\u2013218","journal-title":"IEEE Trans Inf Theory"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Ho T, Leong B, Koetter R, et al. Byzantine modification detection in multicast networks using randomized network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Chicago, 2004. 144","DOI":"10.1109\/ISIT.2004.1365180"},{"key":"52_CR23","doi-asserted-by":"crossref","unstructured":"Charles D, Jain K, Lauter K. Signatures for network coding. In: Proc of the 40th ACISS, Princeton, 2006. 857\u2013863","DOI":"10.1109\/CISS.2006.286587"},{"key":"52_CR24","doi-asserted-by":"crossref","unstructured":"Zhao F, Kalker T, M\u00e9dard M, et al. Signatures for content distribution with network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Nice, 2007. 556\u2013560","DOI":"10.1109\/ISIT.2007.4557283"},{"key":"52_CR25","doi-asserted-by":"crossref","unstructured":"Boneh D, Freeman D, Katz J, et al. Signing a linear subspace: signature schemes for network coding. In: Proc of PKC, Irvine, CA, 2009. 68\u201387","DOI":"10.1007\/978-3-642-00468-1_5"},{"key":"52_CR26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1008304703074","volume":"22","author":"D. R. Stinson","year":"2001","unstructured":"Stinson D R. Something about all or nothing (transforms). Designs Codes Cryptography, 2001, 22: 133\u2013138","journal-title":"Designs Codes Cryptography"},{"key":"52_CR27","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption 1997","author":"R. L. Rivest","year":"1997","unstructured":"Rivest R L. All-or-nothing Encryption and the package transform. In: Biham E, ed. Fast Software Encryption 1997 (LNCS 1267). Berlin: Springer, 1997. 210\u2013218"},{"key":"52_CR28","volume-title":"Introduction to Graph Theory","author":"D. B. West","year":"2001","unstructured":"West D B. Introduction to Graph Theory. 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2001","edition":"2nd ed."}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0052-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-0052-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0052-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:30:07Z","timestamp":1685467807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-0052-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-0052-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}