期刊文献+

一种基于混沌序列的安全网络编码设计与分析 被引量:4

Analysis and Design of Network Coding Based on Chaotic Sequence
下载PDF
导出
摘要 提出了一种低开销的安全网络编码方案。该方案利用混沌序列较高的随机性和对初始条件极度敏感的特性,将混沌序列与原始信源消息向量相结合,构造出"一次一密"的密码体制,从而实现该编码方案的完善保密性。该方案仅在原随机网络编码体制的基础上对信源进行了改变,中间节点保持不变,具有普遍通用性;并且在信源处仅加入一个干扰信号来保证编码方案的安全性。理论分析结果表明,在攻击者具有有限窃听能力的情况下,该安全网络编码方案可以保证完善其保密性,且发送信号的开销最小。 A minimum overhead secure network coding based on chaotic sequence was presented in this paper. Only the source needs to be modified, and intermediate nodes implement a classical distributed network code. So the proposed scheme is applied to all the linear network coding. It combines the chaotic sequence with original source information vec- tor,because of the high randomness and the sensitivity to initial state of chaotic sequence, and the presented network code is "One-Time Pad (OTP)". So the secure network coding achieves complete secrecy. This scheme requires only one noisy symbol to be embedded in the original information symbol vector to achieve complete secrecy. The theoretical a- nalysis confirms that this scheme can achieve the information-theoretic security condition and the signaling overhead to obtain complete security is minimized, while the attacker has limited wiretapping ability.
出处 《计算机科学》 CSCD 北大核心 2013年第5期147-149,163,共4页 Computer Science
基金 2012年辽宁省推荐国家级"大学生创新创业训练计划"项目(201210147036) 辽宁高等学校杰出青年学者成长计划项目(LJQ2012029)资助
关键词 网络编码 混沌序列 一次一密 通用性 完善保密 低开销 Network coding Chaotic sequence One-time pad(OTP) Applicability Complete secrecy Minimum overhead
  • 相关文献

参考文献17

  • 1Ahlswede R, Cai Ning, Li S Y R, et al. Network Information Flow [J]. IEEE Transactions on Information Theory, 2000,46 (4):1204-1216.
  • 2Yeung R W. Distributed source coding for satellite communica- tions [J]. IEEE Transactions on Information Theory, 1999,45 (4):1111-1120.
  • 3Cai N, Yeung R. Secure network coding [C]//IEEE International Symposium Information Theory. 2002,2: 323.
  • 4Feldman J, Malkin T, Servedio R A. On the capacity of secure network coding [C]//42nd Annual Allerton Conf. Commun. 2004.
  • 5Feldman J,Malkin T, Servedio R A. Secure network coding via filtered secret sharing [C]//42nd Annual Allerton Conf. Com- mun. 2004.
  • 6Zhang Yan, Xu Cheng-qi, Wang Feng. A novel scheme for secure network coding using one-time pad [C] // International Conferen- ce on Networks Security, Wireless Communications and Trusted Computing. vol. 1,2009: 92-98.
  • 7Maximilian R, Sagduyu Y E, Honig M L, et al. Training over- head for decoding random linear network codes in wireless net- works [J]. IEEE Journal on Selected Areas in Communications, 2009,27 (5) : 729-737.
  • 8徐光宪,付晓.基于稀疏矩阵的低复杂度安全网络编码算法[J].计算机工程,2012,38(9):55-57. 被引量:7
  • 9Adeli M, Liu Hua-ping. Secure Network Coding with Minimum Overhead Based on Hash Functions [J]. IEEE Communications Letters, 2009,13 (12) : 956-958.
  • 10Jain K. Security based on network topology against the wiretap- ping attacking[J]. IE'EE Wireless Communication, 2004(2) :68-71.

二级参考文献53

  • 1黄谆,白国强,陈弘毅.快速实现SHA-1算法的硬件结构[J].清华大学学报(自然科学版),2005,45(1):123-125. 被引量:19
  • 2陈铭,平西建.基于Arnold变换的图像信息伪装算法[J].计算机应用研究,2006,23(1):235-238. 被引量:19
  • 3Ahlswede R,Cai Ning.Network Information Flow[J].IEEE Trans.on Information Theory,2000,46(4):1204-1216.
  • 4Li S Y R,Yeung R W,Cai Ning.Linear Network Coding[J].IEEETrans.on Information Theory,2003,49(2):371-381.
  • 5Cai Ning,Yeung R W.Secure Network Coding[C]//Proc.ofISIT’02.Lausanne,Switzerland:IEEE Press,2002.
  • 6Bhattad K,Narayanan K R.Weakly Secure Network Coding[EB/OL].(2007-05-22).http://netcod.org/papers/06Bhattad N-final.pdf.
  • 7周亚军,李晖,马建峰.防污染和防窃听的网络编码[D].西安:西安电子科技大学,2009.
  • 8Langberg M,Sprintson A,Bruck J.The Encoding Complexity ofNetwork Coding[J].IEEE Trans.on Information Theory,2006,52(6):2386-2397.
  • 9Bhattad K,Kotter R.Minimal Network Coding for Multicast[C]//Proc.of ISIT’05.Adelaide,Australia:IEEE Press,2005.
  • 10Kim M,Medard M.Evolutionary Approaches to MinimizingNetwork Coding Resources[C]//Proc.of INFOCOM’07.[S.l.]:IEEE Press,2007.

共引文献16

同被引文献36

  • 1罗明星,杨义先,王励成,钮心忻.抗窃听的安全网络编码[J].中国科学:信息科学,2010,40(2):371-380. 被引量:10
  • 2王亚伟,王行愚.一种结合Cat和Logistic映射的混沌加密算法[J].东南大学学报(自然科学版),2005,35(A02):128-131. 被引量:5
  • 3张岩.一种改进的安全网络编码方案的研究[C]//中国电子学会第十五届信息论学术年会论文集.北京:国防工业出版社,2008:962-966.
  • 4Ahlswede R, Cai Ning, Li S Y R, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000,46 (4) :1204-1216.
  • 5Li S Y R,Yeung R W, Cai Ning. Linear network coding [ J ]. IEEE Trans on Information Theory,2003 ,g9(2) :371-381.
  • 6Cai Ning, Yeung R W. Secure network coding [ C]//Proc of IEEE international symposium on information theory. [ s. 1. ] : IEEE ,2002.
  • 7Cai Ning, Yeung R W. Secure network coding on a wiretap network [ J]. IEEE Trans on Information Theory, 2011,57 ( 1 ) :424-435.
  • 8Cai Ning, Chan T. Theory of secure network coding [ J ]. Pro- ceedings of the IEEE ,2011,99 ( 3 ) :421-437.
  • 9Bhattad K,Naraynan K R. Weakly secure network coding[ C ] //Proc of' the 1 st workshop on network coding, theory, and ap- plications. [ s. 1. ] : [ s. n. ] ,2005.
  • 10Harada K, Yamamoto H. Strongly secure linear network coding [ J ]. IEICE Trans on Fundamentals of Electronics, Communi- cations and Computer Sciences, 2008, E91 -A ( 10 ) : 2720 - 2728.

引证文献4

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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