Computer Science ›› 2009, Vol. 36 ›› Issue (10): 108-112.
Previous Articles Next Articles
ZHOU Yao, PING Ping, XU Jia, LIU Feng-yu
Online:
Published:
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
ZHOU Yao, PING Ping, XU Jia, LIU Feng-yu. Pairing-based Traceable Neighborhood Anonymous Authentication Scheme for Wireless Ad hoc Networks[J].Computer Science, 2009, 36(10): 108-112.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2009/V36/I10/108
Cited