作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (1): 147-149. doi: 10.3969/j.issn.1000-3428.2009.01.050

• 安全技术 • 上一篇    下一篇

基于双线性对的Ad Hoc网络门限身份认证方案

吕 鑫1,2,程国胜1,2,许 峰1,2   

  1. (1. 南京信息工程大学数理学院,南京 210044;2. 南京大学技术学院,南京 210093)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-01-05 发布日期:2009-01-05

Threshold Authentication Scheme of Ad Hoc Network ased on Bilinear Pairings

LV Xin1,2, CHENG Guo-sheng1,2, XU Feng1,2   

  1. (1. College of Math & Physics, Nanjing University of Information Science & Technology, Nanjing 210044; 2. College of Technology, Nanjing University, Nanjing 210093)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-01-05 Published:2009-01-05

摘要: 研究移动Ad Hoc网络特有的安全威胁,提出一种基于双线性对、无可信中心的门限身份认证方案。该方案能有效减少网络中各节点的存储代价和运算量,抵御内部节点攻击和被动攻击。与已有Ad Hoc门限身份认证方案相比,其证书生成速度快、计算复杂度低。

关键词: Ad Hoc网络, 双线性对, 概率签名方案, 门限身份认证

Abstract: This paper studies the proper threat of mobile Ad Hoc network, and proposes a threshold authentication scheme without the trusted center based on bilinear pairings. The cost of storage and computational capacity, requiring of each node, can be effectively reduced and security problems such as inner nodes attack, passive attack can be solved. Compared with the existent protocol, this scheme is faster in generating certificate and has lower complexity of computing.

Key words: Ad Hoc network, bilinear pairings, probability signature scheme, threshold authentication

中图分类号: