吉林大学学报(工学版) ›› 2013, Vol. 43 ›› Issue (01): 229-232.

Previous Articles     Next Articles

Strongly secure linear network coding algorithm based on maximum rank distance codes

WANG Xiao, GUO Wang-mei   

  1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China
  • Received:2012-04-09 Online:2013-01-01 Published:2013-01-01

PDF (PC)

283

Abstract: This paper focuses on the problem of eavesdropping adversaries in network coding field. Based on Maximum Rank Distance (MRD) codes, a new strongly secure linear network coding algorithm is proposed. In this algorithm, message is pre-encoded at the source node by using coset coding scheme that uses MRD code over extension filed. Meanwhile, focusing on the intermediate nodes, linear network code over the base field is used. It is proved that the proposed algorithm can transform a non-secure linear network code to a strongly secure code. In other word, the algorithm is a general strongly secure linear network coding algorithm. Also, the proposed algorithm can reduce the coding field size of intermediate code compared to current strongly secure algorithm.

Key words: communication, linear network coding, strongly secure, rank-distance, eavesdropping

CLC Number: 

  • TN911.22
[1] Ahlswede R, Cai N, Li S Y, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000,46(4):1204-1216.

[2] Li S Y, Yeung R W, Cai N. Linear network coding[J]. IEEE Transactions on Information Theory, 2003, 49(2): 371-381.

[3] Cai N, Yeung R W. Secure network coding//IEEE International Symposium on Information Theory (ISIT02), Lausanne, Switzerland, 2002.

[4] Feldman J, Malkin T, Servedio R A, et al. On the capacity of secure network coding//Proc 42nd Annual Allerton Conference on Communication, Control, and Computing, Monticello,USA, 2004.

[5] Silva D, Kschischang F R. Universal secure network coding via rank-metric codes[J]. IEEE Transactions on Information Theory, 2011, 52(2):1124-1135.

[6] Harada K, Yamamoto H. Strongly secure linear network Coding[J]. IEICE Trans Fundamentals, 2008, E91-A(10) : 2720-2728.

[7] Gabiduline M. Theory of codes with maximum rank distance[J]. Problems of Information Transmission,1985,21(1):1-12.

[8] Rouayheb S E, Soljanin E, Sprintson A. Secure network coding for wiretap networks of type Ⅱ[J]. IEEE Transactions on Information Theory, 2012,58(3):1361-1371.
[1] CHEN Yong-heng,LIU Fang-hong,CAO Ning-bo. Analysis of conflict factors between pedestrians and channelized right turn vehicles at signalized intersections [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1669-1676.
[2] CHANG Shan,SONG Rui,HE Shi-wei,LI Hao-dong,YIN Wei-chuan. Recycling model of faulty bike sharing [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1677-1684.
[3] QU Da-yi,YANG Jing-ru,BING Qi-chun,WANG Wu-lin,ZHOU Jing-chun. Arterial traffic offset optimization based on queue characteristics at adjacent intersections [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1685-1693.
[4] ZHOU Yan-guo,ZHANG Hai-lin,CHEN Rui-rui,ZHOU Tao. Two-level game approach based resource allocation scheme in cooperative networks [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1879-1886.
[5] LIU Xiang-yu, YANG Qing-fang, KUI Hai-lin. Traffic guidance cell division based on random walk algorithm [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1380-1386.
[6] LIU Zhao-hui, WANG Chao, LYU Wen-hong, GUAN Xin. Identification of data characteristics of vehicle running status parameters by nonlinear dynamic analysis [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1405-1410.
[7] LUAN Xin, DENG Wei, CHENG Lin, CHEN Xin-yuan. Mixed Logit model for understanding travel mode choice behavior of megalopolitan residents [J]. 吉林大学学报(工学版), 2018, 48(4): 1029-1036.
[8] SUN Xiao-ying, HU Ze-zheng, YANG Jin-peng. Assessment method of electromagnetic pulse sensitivity of vehicle engine system based on hierarchical Bayesian networks [J]. 吉林大学学报(工学版), 2018, 48(4): 1254-1264.
[9] DONG Ying, CUI Meng-yao, WU Hao, WANG Yu-hou. Clustering wireless rechargeable sensor networks charging schedule based on energy prediction [J]. 吉林大学学报(工学版), 2018, 48(4): 1265-1273.
[10] MOU Zong-lei, SONG Ping, ZHAI Ya-yu, CHEN Xiao-xiao. High accuracy measurement method for synchronous triggering pulse transmission delay in distributed test system [J]. 吉林大学学报(工学版), 2018, 48(4): 1274-1281.
[11] DING Ning, CHANG Yu-chun, ZHAO Jian-bo, WANG Chao, YANG Xiao-tian. High-speed CMOS image sensor data acquisition system based on USB 3.0 [J]. 吉林大学学报(工学版), 2018, 48(4): 1298-1304.
[12] CHEN Yong-heng, LIU Xin-shan, XIONG Shuai, WANG Kun-wei, SHEN Yao, YANG Shao-hui. Variable speed limit control under snow and ice conditions for urban expressway in junction bottleneck area [J]. 吉林大学学报(工学版), 2018, 48(3): 677-687.
[13] WANG Zhan-zhong, LU Yue, LIU Xiao-feng, ZHAO Li-ying. Improved harmony search algorithm on truck scheduling for cross docking system [J]. 吉林大学学报(工学版), 2018, 48(3): 688-693.
[14] LI Zhi-hui, HU Yong-li, ZHAO Yong-hua, MA Jia-lei, LI Hai-tao, ZHONG Tao, YANG Shao-hui. Locating moving pedestrian from running vehicle [J]. 吉林大学学报(工学版), 2018, 48(3): 694-703.
[15] CHEN Song, LI Xian-sheng, REN Yuan-yuan. Adaptive signal control method for intersection with hook-turn buses [J]. 吉林大学学报(工学版), 2018, 48(2): 423-429.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © Journal of Jilin University(Engineering and Technology Edition), All Rights Reserved.
Tel: +86-431-85095297　Fax: +86-431-85094074　E-mail: xbgxb@jlu.edu.cn
Powered by Beijing Magtech Co. Ltd