Efficient weakly secure network coding scheme against node conspiracy attack based on network segmentation

In this paper, we consider the problem of building a secure network against node conspiracy attack that based on network segmentation. As we know, network coding has demonstrated its great application prospects in wireless sensor network (WSN) transmission. At the same time, it is facing a variety of security threats, especially conspiracy attack. In existing research, secure coding design strategies are much more than secure topological structure. In this background, a weakly secure scheme is proposed from the perspective of topology and network segmentation. Based on the network segmentation and topology design, the network coding transmission is weakly secure. We conduct a simulation to show that the proposed scheme can efficiently prevent conspiracy attack.

[1]  Ning Cai,et al.  A Security Condition for Multi-Source Linear Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[2]  David Mazières,et al.  On-the-fly verification of rateless erasure codes for efficient content distribution , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.

[3]  Frank R. Kschischang,et al.  Universal weakly secure network coding , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[4]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  O. Ytrehus,et al.  Two Layer Secure Network Coding - (2-LSNC) , 2008, 2008 International Symposium on Telecommunications.

[6]  Rong Du,et al.  Strategies of network coding against nodes conspiracy attack , 2015, Secur. Commun. Networks.

[7]  Tracey Ho,et al.  Byzantine modification detection in multicast networks using randomized network coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[8]  Kunihiko Harada,et al.  Strongly Secure Linear Network Coding , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[9]  Christos Gkantsidis,et al.  Cooperative Security for Network Coding File Distribution , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  Jon Feldman,et al.  On the Capacity of Secure Network Coding , 2004 .

[11]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[12]  Sriram Vishwanath,et al.  On secure communication over wireless erasure networks , 2008, 2008 IEEE International Symposium on Information Theory.

[13]  Krishna R. Narayanan,et al.  Weakly Secure Network Coding , 2005 .

[14]  Yong Guan,et al.  An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[15]  T. Ho,et al.  On Linear Network Coding , 2010 .

[16]  Szabolcs L. Fancsali,et al.  Some applications of finite geometry for secure network coding , 2008, J. Math. Cryptol..

[17]  Kamal Jain.  Security based on network topology against the wiretapping attack , 2004, IEEE Wireless Communications.

[18]  R. Yeung,et al.  Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[19]  Jing Dong,et al.  Toward secure network coding in wireless networks: Threats and challenges , 2008, 2008 4th Workshop on Secure Network Protocols.

[20]  T. Chan,et al.  Capacity bounds for secure network coding , 2008, 2008 Australian Communications Theory Workshop.

[21]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.