期刊文献+

一种有效抗污染攻击的混合网络编码方案

An Effective Hybrid Network Coding Scheme Against Pollution Attacks
下载PDF
导出
摘要 密码学研究者们使用同态签名或同态MAC方案来保障网络编码环境中消息的完整性。然而,随着数据量的增加,同态签名方案的计算开销越来越大;同态MAC方法虽然能够有效地节省计算开销,但是存在标签污染和代间污染问题。为了更有效地保障网络编码中消息的完整性,提高系统的性能,文章提出一种结合同态MAC方案和同态签名方案的混合网络编码方案,利用同态MAC方案为传输的数据包生成一个标签集合,然后对标签集合进行签名。在方案设计中引入了消息的代标识符,中间节点可以依据消息的代标识符对来自同一代消息的数据包进行网络编码。中间节点通过对签名和标签的双重验证来及时发现并丢弃受污染的数据包。经过安全分析,该方案实现了同时抵抗数据污染、标签污染和代间污染三种污染攻击的功能。 Cryptographic researchers use homomorphic signatures or homomorphic MAC methods to ensure message integrity in network coding environments. However, with the increase of the amount of data, the homomorphic signature method has more and more overhead. Although the homomorphic MAC method can effectively reduce the overhead, there are tag pollution and intergenerational pollution problems. In order to more effectively guarantee the integrity of the message in the network coding and improve the system performance, this paper proposes a hybrid network coding scheme combining homomorphic MAC and homomorphic signature, and uses the homomorphic MAC method to generate a label set for the transmitted data packet. Then sign the tag collection. The generation identifier of the message is introduced in the scheme design, and the intermediate node can perform network coding on the data packet from the same generation message according to the generation identifier of the message. The intermediate node can discover and discard contaminated data packets in time through double verification of signatures and labels. Through the safety analysis, the scheme realizes the functions of resisting data pollution, tag pollution and intergenerational pollution.
作者 王雅旋 林喜军 曲海鹏 WANG Yaxuan;LIN Xijun;QU Haipeng(College of Information Science and Engineering, Ocean University of China, Qingdao Shandong 266100, China)
出处 《信息网络安全》 CSCD 北大核心 2019年第5期69-76,共8页 Netinfo Security
基金 国家自然科学基金[61827810] 国家重点研发计划[2016YFB1001103]
关键词 网络编码 标签污染 代间污染 同态MAC 同态签名 network coding tag pollution intergenerational pollution homomorphic MAC homomorphic signature
  • 相关文献

参考文献2

二级参考文献57

  • 1Ramanathan S. Multicast tree generation in networks with asymmetric links [J]. IEEE/ACM Trans, Networking, 1996,4 (4) :558-568.
  • 2Moses Charikar, Chandra Chekuri, To-yat Cheung, et al. Approximation algorithms for directed Steiner problems[C]. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), 1998, 192-200.
  • 3Leonid Zosin, Samir Khuller. On directed steiner trees[C]. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), 2002, 59-63.
  • 4Bollobas B. Graph theory an introductory course [M]. New York : Springer-Verlag, 1979.
  • 5Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, et al. Network information flow [J]. IEEE Trans. Inform. Theory, 2000, 46(4) : 1204-1216.
  • 6Agarwal A, Charikar M. On the advantage of network coding for improving network throughput [Z]. Information Theory Workshop, 2004. IEEE 24-29 Oct. 2004, 247-249
  • 7Lun D, Ramakar N, Koetter R, et al. Achieving minimum-cost multicast: a decentralized approach based on network coding [C]. In: Proceedings of IEEE INFOCOM, Mar, 2005.
  • 8Fragouli C, Soljanin E. Decentralized network coding[Z]. Information Theory Workshop, 2004. IEEE 24-29 Oct. 2004: 310-314.
  • 9Gkantsidis C, Rodriguez P R. Network coding for large scale content distribution[Z]. Microsofy: Research, 2004.
  • 10Bhadra S, Shakkottai S, Gupta P. Min-cost selfish multieast with network coding[C]. In: 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 03-06 April 2006 . 1-8.

共引文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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