计算机科学 ›› 2013, Vol. 40 ›› Issue (5): 147-149.

• 信息安全 • 上一篇    下一篇

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

徐光宪,李晓彤,罗荟荟   

  1. 辽宁工程技术大学电子与信息工程学院 葫芦岛125105;辽宁工程技术大学电子与信息工程学院 葫芦岛125105;辽宁工程技术大学电子与信息工程学院 葫芦岛125105
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受2012年辽宁省推荐国家级“大学生创新创业训练计划”项目(201210147036),辽宁高等学校杰出青年学者成长计划项目(LJQ2012029)资助

Analysis and Design of Network Coding Based on Chaotic Sequence

XU Guang-xian,LI Xiao-tong and LUO Hui-hui   

  • Online:2018-11-16 Published:2018-11-16

摘要: 提出了一种低开销的安全网络编码方案。该方案利用混沌序列较高的随机性和对初始条件极度敏感的特性,将混沌序列与原始信源消息向量相结合,构造出“一次一密”的密码体制,从而实现该编码方案的完善保密性。该方案仅在原随机网络编码体制的基础上对信源进行了改变,中间节点保持不变,具有普遍通用性;并且在信源处仅加入一个干扰信号来保证编码方案的安全性。理论分析结果表明,在攻击者具有有限窃听能力的情况下,该安全网络编码方案可以保证完善其保密性,且发送信号的开销最小。

关键词: 网络编码,混沌序列,一次一密,通用性,完善保密,低开销

Abstract: 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 vector,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 analysis 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.

Key words: Network coding,Chaotic sequence,One-time pad(OTP),Applicability,Complete secrecy,Minimum overhead

[1] Ahlswede R,Cai Ning,Li S Y R,et al.Network Information Flow [J].IEEE Transactions on Information Theory,2000,46(4):1204-1216
[2] Yeung R W.Distributed source coding for satellite communications [J].IEEE Transactions on Information Theory,1999,45(4):1111-1120
[3] Cai N,Yeung R.Secure network coding [C]∥IEEE InternationalSymposium Information Theory.2002,2:323
[4] Feldman J,Malkin T,Servedio R A.On the capacity of secure network coding [C]∥42nd Annual Allerton Conf.Commun.2004
[5] Feldman J,Malkin T,Servedio R A.Secure network coding via filtered secret sharing [C]∥42nd Annual Allerton Conf.Commun.2004
[6] Zhang 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,9:92-98
[7] Maximilian R,Sagduyu Y E,Honig M L,et al.Training overhead for decoding random linear network codes in wireless networks [J].IEEE Journal on Selected Areas in Communications,2009,27(5):729-737
[8] 徐光宪,付晓.基于稀疏矩阵的低复杂度安全网络编码算法[J].计算机工程,2012,38(9):55-57
[9] Adeli M,Liu Hua-ping.Secure Network Coding with Minimum Overhead Based on Hash Functions [J].IEEE Communications Letters,2009,13(12):956-958
[10] 李克荣.基于网络编码和Hash函数的一个保密通信方案 [D].扬州:扬州大学,2010
[11] Jain K.Security based on network topology against the wiretapping attacking[J].IEEE Wireless Communication,2004(2):68-71
[12] Bhattad K,Narayanan K R.Weakly Secure Network Coding[EB/OL].http://netcod.org/papers/06Bhattad N-final.pdf,2007-05-22
[13] 赵慧,卓新建,陆传赉.一种基于网络拓扑的安全网络编码算法分析 [C]∥通信理论与技术新进展—第十三届全国青少年通信学术会议.2008:844-846
[14] 徐光宪,付晓.抗万能攻击的安全网络编码[J].计算机科学,2012,39(8):88-91
[15] 徐光宪,吴巍.基于伪随机序列的Arnold加密算法[J].计算机科学,2012,39(12):79-82[15]李菲菲.混沌扩频序列的研究 [D].葫芦岛:辽宁工程技术大学,2011
[16] Jaggi S,Sanders P,Chou P A,et al.Polynomial time algorithms for multicast network code construction [J].IEEE Transactions on Information Theory,2005,51(6):1973-1982
[17] 王汝言,楼芃雯,樊思龙,等.容迟网络编码节点状态感知的数据转发策略[J].重庆邮电大学学报:自然科学版,2013,5(2):215-220

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!