期刊文献+

一种对抗全局窃听的网络编码方案

A Network Coding Scheme against Global Eavesdropping
下载PDF
导出
摘要 针对安全网络编码方案中信源节点组播率受限的问题,提出了一种基于logistic混沌映射的加密方案。首先Logistic混沌序列对初始值向量经过多次迭代,生成结果向量,再利用结果向量构造预编码矩阵,最后通过预编码矩阵和结果向量生成大数矩阵对信源消息进行隐藏。为了使数据在有限域中进行运算,对大数进行取整,并进行除法操作,商矩阵进行加密处理,余数矩阵进行网络编码,从而达到对抗窃听的目的。与传统的对抗窃听攻击方案相比,在同等带宽开销的前提下,扩大了源节点组播率的限制范围,既适用于单源网络,也适用于多源多宿网络,理论分析和实验结果表明,该方案能够对抗全局窃听,且能成功编解码。 Aiming at the limited multicast rate of the source nodes in the secure network coding scheme,an encryption scheme based on logistic chaotic mapping is proposed.Firstly,the logistic chaotic sequence performs multiple iterations on the initial value vector to generate the result vector.Then,the result vector is used to construct the precoding matrix.Finally,a large number matrix is generated through the precoding matrix and the result vector to hide the source message.In order to make the data operate in a finite domain,the large numbers are rounded and divided,the quotient matrix is encrypted,and the remainder matrix is network-coded,so as to achieve the purpose of fighting eavesdropping.Compared with the traditional antieavesdropping attack scheme,this scheme does not need to consider the eavesdropper’s eavesdropping ability.Under the premise of the same bandwidth cost,the limited range of the source-point multicast rate is expanded,which is suitable for both single-source networks and multi-source and multi-sink networks.Theoretical analysis and experimental results indicate that this scheme can resist global eavesdropping and can successfully encode and decode.
作者 周影 褚丽莉 陈佳 ZHOU Ying;CHU Lili;CHEN Jia(Liaoning University of Technology,Jinzhou Liaoning 121001,China)
机构地区 辽宁工业大学
出处 《通信技术》 2021年第1期164-168,共5页 Communications Technology
关键词 网络编码 窃听攻击 LOGISTIC混沌映射 预编码矩阵 network coding eavesdropping attack logistic chaotic mapping precoded matrix
  • 相关文献

参考文献2

二级参考文献20

  • 1AHLSWEDE R,CAI N,LI S-Y R,et al.Network information flow[J].IEEE Transactions on Information Theory,2000,46(4):1204-1216.
  • 2JAGGI S,SANDERS P,CHOU A,et al.Polynomial time algorithms for multicast network code construction[J].IEEE Transactions on Information Theory,2006,51(6):1973-1982.
  • 3HO T,MEDARD M,KOETTER R,et al.A random linear network coding approach to multicast[J].IEEE Transactions on Information Theory,2006,52(10):4413-4430.
  • 4RAYMOND W Y.Information theory and network coding[M].Berlin:Springer,2010:505-545.
  • 5YAN X,YANG J,ZHANG Z.An outer bound for multisource multisink network coding with minimum cost consideration[J].IEEE Transaction on Information Theory,2006,52(6):2373-2385.
  • 6YAN X,YEUNG R W,ZHANG Z.The capacity region for multi-source multi-sink network coding[C]//ISIT 2007:Proceedings of the 2007 IEEE International Symposium on Information Theory.Piscataway:IEEE,2007:116-120.
  • 7ROMANMOORTHY A,JAIN K,CHOU P A.Separating distributed source coding from network coding[J].IEEE Transactions on Information Theory,2006,52(6):2785-2795.
  • 8YOUAIL R S,CHRNG W,TAO S G.Achieving the information rate region for two sources two sinks network coding:An extended work[C]//ICIEA 2009:Proceedings of the 4th IEEE Conference on Industrial Electronics and Applications.Piscataway:IEEE,2009:768-722.
  • 9HUANG S R.Network coding for multiple unicast over directed acyclic networks[D].Ames:Iowa State University,2013.
  • 10HUANG S Y,RAMAMOORTHY A.An achievable region for the double unicast problem based on a minimum cut analysis[J].IEEE Transaction on Communications,2013,61(7):2890-2899.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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