计算机科学 ›› 2009, Vol. 36 ›› Issue (10): 108-112.

• 计算机网络与信息安全 • 上一篇    下一篇

基于对的无线Ad hoc网络可追踪邻居匿名认证方案

周耀,平萍,徐佳,刘凤玉   

  1. (南京理工大学计算机科学与技术学院 南京 210094)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金资助项目(90718021),“十一五”重点研究项目“无线自组网自适应架构及安全性研究”资助。

Pairing-based Traceable Neighborhood Anonymous Authentication Scheme for Wireless Ad hoc Networks

ZHOU Yao, PING Ping, XU Jia, LIU Feng-yu   

  • Online:2018-11-16 Published:2018-11-16

摘要: 为解决传统无线Ad hoc网络部居匿名认证方案容侵性不佳以及难以锁定恶意节点身份的问题,提出一种基于双线性对的无线Ad hoc网络可追踪部居匿名认证方案。采用基于身份的公钥系统,节点随机选择私钥空间中的数作为临时私钥,与身份映射空间的节点公钥以及一个公开的生成元模相乘得到临时公钥,利用双线性映射的性质协商会话密钥并实现匿名认证。通过在随机预言机模型下的形式化分析,表明本方案在BCDH问题难解的假设下可对抗攻击者的伪装行为,同时利用认证过程中交互的临时公钥可有效锁定恶意节点真实身份。

关键词: 计算机应用,匿名认证,双线性对,可追踪,无线Ad hoc网络

Abstract: To improve the disadvantage in traditional anonymous authentication schemes for wireless ad hoc networks which are vulnerable to nodes intrusion and unable to trace malicious nodes, a pairing-based traceable neighborhood anonymous authentication scheme was proposed. Using an ID based public key system, the authenticating node chooses a random number from the private key space as its temper private key, and then multiplies this temper private key with his ID based public key and an all-known generator respectively to create its temper public key. Using such temper keys pair, the node can establish anonymous authentication with its neighbors in a secure and efficient way. By formally analyzing this scheme under random oracle model,it is shown that this scheme can efficiently resist the impersonation attacks as long as the BCDH problem is hard and the hostile nodes can be traced through their temper public keys by the network manager.

Key words: Computer application, Anonymous authentication, Bilinear pairing, Traceable, MANET

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!