Theory of Secure Network Coding

被引:64
作者
Cai, Ning [1 ]
Chan, Terence [2 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks ISN, Xian 710071, Peoples R China
[2] Univ S Australia, Inst Telecommun Res, Adelaide, SA 5095, Australia
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
Entropy; linear subspace; linear transformation; network coding; security; wiretap channels; ERROR-CORRECTION;
D O I
10.1109/JPROC.2010.2094592
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this tutorial paper, we focus on the basic theory of linear secure network coding. Our goal is to present fundamental results and provide preliminary knowledge for anyone interested in the area. We first present a model for secure network coding and then a necessary and sufficient condition for a linear network code to be secure. Optimal methods to construct linear secure network codes are also provided. For further investigation of the secure properties of linear network codes, we illuminate different secure criteria and requirements, with a few alternative models.
引用
收藏
页码:421 / 437
页数:17
相关论文
共 42 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
[Anonymous], 2005, Foundation and Trends in Communications and Information Theory
[3]  
[Anonymous], 2005, NETCOD
[4]  
Blakley C., 1985, Advances in Cryptology, P242
[5]  
Blakley G.R., 1979, INT WORKSH MAN REQ K, DOI [10.1109/MARK.1979.8817296, DOI 10.1109/MARK.1979.8817296]
[6]   Secure network coding [J].
Cai, N ;
Yeung, RW .
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :323-323
[7]  
CAI N, IEEE T INF IN PRESS
[8]   A security condition for multi-source linear network coding [J].
Cai, Ning ;
Yeung, Raymond W. .
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :561-+
[9]  
Cai N, 2006, COMMUN INF SYST, V6, P37
[10]   Valuable Messages and Random Outputs of Channels in Linear Network Coding [J].
Cai, Ning .
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, :413-417