计算机应用 ›› 2020, Vol. 40 ›› Issue (11): 3236-3241.DOI: 10.11772/j.issn.1001-9081.2020030400

• 网络空间安全 • 上一篇    下一篇

基于身份的动态层簇式无线传感网络认证算法

袁驰   

  1. 中国人民大学 信息学院, 北京 100872
  • 收稿日期:2020-04-02 修回日期:2020-06-01 出版日期:2020-11-10 发布日期:2020-06-15
  • 作者简介:袁驰(1980-),男,河南南阳人,高级工程师,博士研究生,主要研究方向:无线自组织网络安全、密钥预分配、私钥托管;chiyuan@ruc.edu.cn
  • 基金资助:
    中国人民大学研究生科学研究基金重点项目(16XHN116)。

Identity-based dynamic clustering authentication algorithm for wireless sensor networks

YUAN Chi   

  1. School of Information, Renmin University of China, Beijing 100872, China
  • Received:2020-04-02 Revised:2020-06-01 Online:2020-11-10 Published:2020-06-15
  • Supported by:
    This work is partly supported by the Key Program of Graduate Research Funds of Renmin University of China (16XNH116).

摘要: 无线传感器网络(WSN)容易受到恶意攻击,而现有的基于身份的密码体制带来了私钥托管问题,对此提出了一种基于身份的分簇认证(IDC)算法。首先,算法没有私钥生成中心(PRKG),只有一个公钥生成中心(PUKG)用来生成申请者的公钥,而由用户单独选定自己的私钥,真正解决了基于身份的密码体制中存在的密钥托管问题。同时,算法动态生成的伪秘矩阵可以杜绝合谋攻击,保证了算法的安全性。最后,针对节点自身拥有资源的差异,采用分层分级处理,一次完成(解)签密,降低了节点的计算量和存储量。在时间消耗和能量消耗两个方面,新提出的IDC算法比同类型的三种算法减少20%以上;在算法鲁棒性方面,当网络数据包快速增大时,IDC算法表现更加平稳,即能量消耗介于1 mJ到10 mJ之间,跨度不大于1.3 mJ;而该算法的时间消耗一直保持在0.002~0.006 s。模拟实验表明,新提出的IDC算法更加适用于对安全性和能量消耗要求严格的WSN。

关键词: 动态认证, 分簇, 密钥托管, 伪秘矩阵, 合谋攻击

Abstract: Aiming at the problem that the Wireless Sensor Network (WSN) is vulnerable to malicious attacks and the private key escrow problem caused by the existing identity-based cryptosystem, an Identity-based Dynamic Clustering authentication (IDC) algorithm was proposed. Firstly, PRivate Key Generator (PRKG) was avoided in the algorithm, the applicants' public key was generated by the PUblic Key Generator (PUKG), and the private key was chosen by the user himself separately, so that the key escrow problem in the identity-based cryptosystem was resolved completely. At the same time, the pseudo-secret matrix was generated dynamically by the algorithm, which could avoid collusion attacks so as to guarantee the security of the algorithm. Finally, in view of the differences in the resources owned by different nodes, the layered and hierarchical processing was used to complete the (un) signcryption at once, therefore reducing the node load of calculation and storage. The time consumption and energy consumption of the newly proposed IDC algorithm are reduced by more than 20% compared to those of the other three algorithms of the same type. In the term of algorithm robustness, when the network data packet increases rapidly, IDC algorithm performs more stably, which means the energy consumption is between 1 mJ and 10 mJ, with the span not more than 1.3 mJ. The time consumption of the algorithm is between 0.002 s and 0.006 s. Simulation experiments show that the newly proposed IDC algorithm is more suitable for the WSN with strict requirements on safety and energy consumption.

Key words: dynamic authentication, clustering, key escrow, pseudo-secret matrix, collusion attack

中图分类号: