Security Analysis and Evaluation of Random Linear Network coding under Wiretapping Attack

This paper discussed the weak security of random linear network coding in wireless network in view of network coding weak security theory where the wiretapper can successfully obtain initial data and conditions threatening transmission security by decoding. The experiment results displayed, in wireless network, the relationship between decodes success probability of multi-node co-wiretapping, the decodes time of destination node and the node number in round and network, the number of data packet which source node sends every time, Galois field size and transmission radius of each node.

[1]  Ning Cai,et al.  Network coding and error correction , 2002, Proceedings of the IEEE Information Theory Workshop.

[2]  Shen Cai-liang.  Secure network coding against wiretapping attacks , 2012 .

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

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

[5]  Richard D. Wesel,et al.  On the capacity of network coding for random networks , 2005, IEEE Transactions on Information Theory.

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

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

[8]  Jianlong Tan,et al.  Secure Network Coding with a Cost Criterion , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[9]  Frank R. Kschischang,et al.  Security for wiretap networks via rank-metric codes , 2007, 2008 IEEE International Symposium on Information Theory.

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