Secure network coding in the presence of eavesdroppers  

作　　者：LUO MingXing1,2,3, YANG YiXian1,2,3, WANG LiCheng1,2,3 & NIU XinXin1,2,3 1Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China 2Key Laboratory of Network and Information Attack and Defence Technology of MOE, Beijing University of Posts and Telecommunications, Beijing 100876, China 3National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China 

出　　处：《Science China(Information Sciences)》2010年第3期648-658,共11页中国科学（信息科学）（英文版）

基　　金：supported by the National Natural Science Foundation of China (NSFC);the Research Grants Council of Hong Kong (RGC) Joint Research Scheme (Grant No. 60731160626);the 111 Project (Grant No.B08004);the National Natural Science Foundation of China (Grant Nos. 60821001, 90718001);the Chinese Universities Scientific Fund (Grant No. BUPT2009RC0220)

摘　　要：Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.

关 键 词：all-or-nothing transformation secure network coding EAVESDROPPING 

分 类 号：TN918.91[电子电信—通信与信息系统]