期刊文献+

新的对抗全局窃听的安全网络编码方案

Novel secure network coding scheme against global wiretapping
下载PDF
导出
摘要 现有的对抗全局窃听攻击的安全网络编码方案存在引入了带宽开销、导致了很高的计算复杂度的问题,为了降低带宽开销并且提升实际编码效率,提出了一种新的对抗全局窃听的安全网络编码方案。对于编码域大小为q的网络编码,该方案利用密钥生成两个长度为q的置换序列,并利用置换序列对信源消息进行混合和替换,从而实现对抗全局窃听攻击。该方案只需在信源节点对信源消息进行加密,在中间节点不需作任何改变。由于该方案加密算法简单、编码复杂度低并且不需要预编码操作,因此该方案没有引入带宽开销且具有较高的实际编码效率。分析结果表明该方案不但可以抵抗唯密文攻击,对于已知明文攻击也有很好的抵抗效果。 The existing schemes against global wiretapping attacks for network coding have the problems of bringing bandwidth overhead and incuring high computational complexity. In order to reduce the bandwidth overhead and enhance the actual coding efficiency, a novel secure network coding scheme against global wiretapping was proposed. For the network coding with the size of field is q, two permutation sequences of length q were generated by using the key, and the source message was mixed and replaced by using the permutation sequences so as to resist global wiretapping attacks. The source message was only encrypted at the source node and had no change at the intermediate nodes. The proposed scheme has a simple encryption algorithm, low coding complexity and doesn't need pre-coding, so it doesn't bring bandwidth overhead and has high actual coding efficiency. The analysis results show that the proposed scheme can resist not only the ciphertext-only attacks but also the known-plaintext attacks efficiently.
出处 《计算机应用》 CSCD 北大核心 2016年第12期3317-3321,3327,共6页 journal of Computer Applications
关键词 网络编码 全局窃听 置换序列 唯密文攻击 已知明文攻击 network coding global wiretapping permutation sequence ciphertext-only attack known-plaintext attack
  • 相关文献

参考文献3

二级参考文献70

  • 1Ahlswede R, Cai N, Li S-Y R, et al. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.
  • 2Li S-Y R, Yeung R W, Cai N. Linear network coding [J]. IEEE Transactions on Information Theory, 2003, 49(2): 371-381,.
  • 3Koetter R, Kschischang F. Coding for errors and erasures in random network coding [J]. IEEE Transactions on Informa- tion Theory, 2008, 54(8): 3579-3591.
  • 4Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast [J]. IEEE Transactions on In- formation Theory, 2006, 52(10): 4413-4430.
  • 5Fragouli C, Katabi D, Markopoulou A, et al. Wireless net- work coding: Opportunities & challenges [C]//IEEE Military Communications Conference, 2007. Orlando: IEEE Press, 2007: 1-8.
  • 6Cai N, Yeung R W. Secure network coding [C]// Proceed- ings of International Symposium in Information Theory, Lausanne, Switzerland: IEEE Press, 2002: 323.
  • 7Feldman J, Malkin T, Servedio R A, et al. On the capacity of secure network coding [C]//Proceedings of 42nd Annual A1- lerton Conference on Communication, Control, and Com- puting. Monticello: Curran Associates, Inc., 2004: 388-401.
  • 8Rouayheb S Y E, Soljanin E, Sprintson A. Secure network coding for wiretap networks of type Ⅱ [EB/OL]. [2013-03-10]. http://arxiv.org/pdf10907.3493.pdf.
  • 9Ozarow L H, Wyner A D. Wire-tap channel II [J]. AT & T BellLabs TechJ, 1984, 63: 2135-2157.
  • 10Silva D, Kschischang F R. Universal secure network coding via rank-metric codes [J]. IEEE Transactions on Information Theory, 2011, 57: 1124-1135.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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