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

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

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

CLC Number: 

• TP393.08