Computer Science ›› 2014, Vol. 41 ›› Issue (9): 174-177.doi: 10.11896/j.issn.1002-137X.2014.09.033

Previous Articles     Next Articles

Random Network Coding Based on Anti-eavesdropping and Byzantine Adversaries

ZHAO Jia-jia and REN Ping-an   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Random network coding has been widely applied in the actual network environment,and can effectively improve network throughput.However,network coding is vulnerable to eavesdropping attack and Byzantine attack.This paper presented a random network coding algorithm that can prevent the eavesdropping adversaries and effectively detect Byzantine modification.There is a secret channel sharing between the source and destination,and the algorithm increases a few computations and redundancies to achieve anti- eavesdropping attack and anti- Byzantine attack through the hash function.The algorithm only changes the encoding method of the source node and the decoding method of the destination node based on the random network coding,and the intermediate nodes remain unchanged.It has a high coding efficiency.

Key words: Network coding,Eavesdropping,Byzantine,Hash function,Secure channel

[1] Ahlswede R,Cai N,Li S-Y R,et al.Network information flow[J].IEEE Transactions on Information Theory,2000,46:1204-1216
[2] Li S-Y R,Yeung R W,Cai N.Linear network coding[J].IEEE Transactions on Information Theory,2003,49:371-381
[3] Ho T,Medard M,Shi J,et al.On randomized network coding[C]∥41st Annual Allerton Conference on Communication Control and Computing.Oct.2003
[4] Ho T,Leong B,Koetter R,et al.Toward a random operation of networks[J].IEEE Transactions on Information Theory,submitted,2004
[5] Cai N,Yeung R W.Secure network coding[C]∥International Symposium on Information Theory (ISIT) 2002.Lausanne,Switzerland,2002:30-50
[6] Bhattad K,Narayanan K R.Weakly secure network coding[C]∥Proc.1st Workshop Netw.Coding Theory Appl,Apr.2005
[7] Ho T.Networking from a network coding perspective [D].MIT,2004
[8] Jaggi S,Langberg M,Katei S.Resilient Network Coding in the Presence of Byzantine Adversaries [C]∥26th IEEE International Conference on Computer Communications.Anchorage:IEEE Press,2012:616-624
[9] Nutman L,Langberg M.Adversarial Models and ResilientSchemes for Network Coding [C]∥IEEE Intl Symp Inf Theory.Toronto:IEEE Press,2008:171-175
[10] Cai N,Yeung R W.Network Coding and Error Correction [C]∥IEEE Inform Theory Workshop.Bangalore:IEEE Press,2002:119-122
[11] Zhang Z.Network Error Correction Coding in Packetized Networks [C]∥IEEE Information Theory Workshop Chengdu, ITW’06.IEEE Press,Chengdu,2006:433-437
[12] Zhang Z.Linear Network Error Correction Codes in Packet Networks [J].IEEE Trans on Inf Theory,2012,54(1):209-218
[13] 韦勇,连一峰.基于日志审计与性能修正算法的网络安全态势评估模型[J].计算机学报,2009,32(4):763-772
[14] Ho T,Leong B,Koetter R.Byzantine Modification Detection in Multicast Networks with Random Network Coding [J].IEEE Transactions on Information Theory,2012,54(6):2798-2830
[15] 周业军,李晖,马建峰.一种防窃听的随机网络编码 [J].西安电子科技大学学报,2009,35(1):696-701
[16] 武广柱,王劲林,齐卫宁.ARLNCStream:自适应随机网络编码流媒体系统[J].电子与信息学报,2008,30(1):25-28
[17] 王汝言,楼芃雯,樊思龙,等.容迟网络编码节点状态感知的数据转发策略[J].重庆邮电大学学报:自然科学版,2013,5(2):215-220

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .