A security condition for multi-source linear network coding

被引：37

作者：

Cai, Ning ^{[1
]}

Yeung, Raymond W. ^{[2
]}

机构：

[1] Xidian Univ, State Key Lab ISN, Xian, Shaanxi, Peoples R China

[2] Chinese Univ Hong Kong, Dept Informat Engn, Hong Hom, Hong Kong, Peoples R China

来源：

2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 | 2007年

基金：

中国国家自然科学基金;

关键词：

D O I：

10.1109/ISIT.2007.4557284

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We obtain a necessary and sufficient condition for the security of multi-source linear network codes by studying the algebraic structure of such codes. This condition is useful for analyzing the security of such linear network codes, and it applies in cases when the random keys do not necessarily have uniform distributions. This condition also shows that the security of a linear network code does not depend on the source distribution.

引用

页码：561 / +

页数：2

共 7 条

[1]

Blakley G. R., 1979, AFIPS Conference Proceedings, vol.48. 1979 National Computer Conference, P313, DOI 10.1109/MARK.1979.8817296

[2]

CAI N, 2002, 2002 IEE INT S INF T

[3] Linear network coding [J].

Li, SYR ;

Yeung, RW ;

Cai, N .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (02) :371-381

[4]

Servedio R. A., 2004, P 42 ANN ALL C COMM

[5] HOW TO SHARE A SECRET [J].

SHAMIR, A .

COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613

[6] COMMUNICATION THEORY OF SECRECY SYSTEMS [J].

SHANNON, CE .

BELL SYSTEM TECHNICAL JOURNAL, 1949, 28 (04) :656-715

[7]

Yeung R. W., 2005, NETWORK CODING THEOR

← 1 →