期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于列表译码法的改进的安全网络编码 被引量：2

An Improved Secure Network Coding Based on List-decoding Algorithm
下载PDF
导出
摘要 提出一种基于列表译码法的改进的安全网络编码算法,该算法仅在原随机编码体制的基础上对信源和信宿进行了改变,中间节点保持不变.在信源处,该算法向信源信息中加入少量冗余,并利用稀疏矩阵对其进行矩阵变换,从而增强信息在传输过程中的抗窃听能力;在信宿处,用列表译码法对收到的信息进行译码,从而对污染攻击进行检测和排除.信源和信宿之间不需要任何秘密信道.理论分析和仿真结果表明,该算法能够在多项式时间内设计完成,能够抵抗强窃听和污染等安全性攻击,使得原本的随机网络编码以很高的概率达到信息论安全的要求;该算法提高了编码速率,减小了存储空间的占用. An improved secure network coding based on list-decoding was presented in this paper. And only the source and destination need to be modified, intermediate nodes implement a classical distributed network code. The algorithm transforms the source news with sparse matrix and adds a small amount of redundancy in source news to enhance the data anti-wiretapping capacity. And in order to detect and eliminate pollution attacks, the receiver use list-decoding algorithm to recover the source news. There is no secret sharing channel between information source and information sink. The theoretical analyses and simulations both confirm that this algorithm can be designed and implemented in polynomial time, resistant eavesdropping and pollution attacks. At the same time, this algorithm can also make the standard random network coding achieve the information-theoretic security condition at a high probability, increase the encoding rate and reduce the occupied memory space.
作者 徐光宪 付晓
机构地区 辽宁工程技术大学电子与信息工程学院
出处 《小型微型计算机系统》 CSCD 北大核心 2013年第4期769-773,共5页 Journal of Chinese Computer Systems
基金 辽宁省重点实验室项目(2009S051)资助
关键词 网络编码 稀疏矩阵 列表译码 强窃听 污染攻击 信息论安全 编码速率 network coding sparse matrix list decoding strong eavesdropping pollution attacks information-theoretic security encoding rate
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献4

二级参考文献67

  • 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.

共引文献12

同被引文献24

  • 1AHLSWEDE R, CAI N, LI S Y R, ef o/. Network information flow[J]. IEEE Trans on Information Theory,2000,46(4) :1204-1216.
  • 2CAI N, YEUNG R W. Secure network coding[C]// Proc of IEEEInternational Symposium on Information Tlieory. [S. 1,] : IEEE Com-puter Society, 2002 :323-340.
  • 3FELDMAN J, MALKIN T, STEIN C,ei al. On the capacity of securenetwork coding [C] // Proc of the 42 nd Annual Allerton Conferenceon Communication,Control,and Computing. Monticello : Curran As-sociates ,2004 ;30-40.
  • 4KROHN M N,FREEDMAN M, MAZIERESJ D. On-the-fly verifica-tion of rateless erasure codes for efficient content distribution [C] //Proc of IEEE Symposium on Security and Privacy. [S. 1.] : IEEEComputer Society ,2004:226-240.
  • 5GKANTSIDIS C, RODRIGUEZ P. Cooperative security for networkcoding file distribution[C]//Proc of the 25th IEEE International Con-ference on Computer Communications. 2006:743-757.
  • 6张岩.一种改进的安全网络编码方案的研究[C]//中国电子学会第十五届信息论学术年会论文集.北京:国防工业出版社,2008:962-966.
  • 7Ahlswede R, Cai N, Li SYR, et al. Network information flow. IEEE Trans. on Information Theory, 2000, 46(4): 1204-1216.
  • 8Li SYR, Yeung RW, Cai N. Linear network coding. IEEE Trans. on Information Theory, 2003, 49(2): 371-381.
  • 9Ho T, Koetter R, Medard M, et al. The benefits of coding over routing in a randomized setting. Proc. of the IEEE International Symposium on Information Theory. 2003. 442.
  • 10Krohn MN, Freedman MJ, Mazieres D. On-the-fly verification of rateless erasure codes for efficient content distribution. Proc. IEEE Symposium on Security and Privacy, 2004. IEEE. 2004. 226-240.

引证文献2

二级引证文献9

小型微型计算机系统
2013年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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