期刊文献+

可抵抗全局窃听者的香农安全性网络纠错码

Shannon secure error-correcting network codes against global eavesdropper
下载PDF
导出
摘要 为改进现有香农安全性网络纠错码会造成传输速率下降以及无法防御全局窃听者的缺点,提出一种基于秘密信道设计的安全策略,利用该安全策略和秩度量网络纠错码构造了一种新的安全网络纠错码。该安全策略通过对源信息添加随机信息以增加传输安全性,并通过对随机信息进行随机置换使得秘密共享信息量渐近可忽略。理论分析结果表明,该安全网络纠错码达到香农安全性且能防御全局窃听者,同时不会因为提高网络编码传输的安全性而导致传输速率下降。 To improve the security performance and the transmission rate of SEC network codes against global eavesdroppers, a new secure policy based on secret channels is proposed, and a class of new SEC network codes is constructed by combining the new secure policy and rank-metric error-correcting network codes. The new secure policy secures the transmission by adding ran- dom information to source information, and asymptotically reduces the bandwidth for secret sharing to 0 by renewing random in- formation with permutation. With theoretically proving, the following conclusion can be presented: the proposed SEC codes are Shannon secure and able to defeat global eavesdropper. Moreover, the proposed SEC codes will not suffer from any rate loss for the enhanced security.
出处 《计算机工程与设计》 CSCD 北大核心 2012年第4期1261-1265,共5页 Computer Engineering and Design
基金 国家自然科学基金项目(60972011) 高等学校博士学科点专项科研基金项目(20100002110033)
关键词 窃听 安全 纠错 网络编码 传输速率 eavesdrop secure error-correcting network coding transmission rate
  • 相关文献

参考文献1

二级参考文献25

  • 1Ahlswede R, Cai N, and Li S Y, et al.. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.
  • 2Li S Y, Yeung R W, and Cai N. Linear network coding [J]. IEEE Transactions on Information Theory, 2003, 49(2): 371-381.
  • 3Ho T, Koetter R, and Medard M, et al.. The benefits of coding over routing in a randomized setting [C]. IEEE International Symposium on Information Theory, Yokohama Japan, 2003: 442.
  • 4Geill O, Matsumoto R, and Thomsenl C. On field size and success probability in network coding [C]. Lecture Notes in Computer Science, 2008, 5130: 157-173.
  • 5Cai N and Yeung R W. Secure network coding [C]. IEEE International Symposium on Information Theory, Lausanne, Switzerland, 2002.. 323.
  • 6Feldman J, Malkin T, and Stein C, et al.. On the capacity of secure network coding [C]. In Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, Sep. 2004.
  • 7Chanl T and Grant A. Capacity bounds for secure network coding [C]. Communication theory workshop, Australian, 2008: 95-100.
  • 8Bhattad K and Narayanan K R. Weakly secure network coding [C]. In Proc. of the First Workshop on Network Coding, Theory, and Applications (NetCod), Riva del, Garda Italy, 2005.
  • 9Jain K. Security based on network topology against the wiretapping attack [J]. IEEE Wireless Communications, 2004, 11(1): 68-71.
  • 10Lima L, Medard M, and Barros J. Random linear network coding: A free cipher? [C]. IEEE International Symposium on Information Theory, Nice, France, 2007: 546-550.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部