標題: ABAKA: An Anonymous Batch Authenticated and Key Agreement Scheme for Value-Added Services in Vehicular Ad Hoc Networks
作者: Huang, Jiun-Long
Yeh, Lo-Yao
Chien, Hung-Yu
資訊工程學系
Department of Computer Science
關鍵字: Authentication;batch verification;conditional privacy;elliptic curve cryptographic
公開日期: 1-Jan-2011
摘要: In this paper, we introduce an anonymous batch authenticated and key agreement (ABAKA) scheme to authenticate multiple requests sent from different vehicles and establish different session keys for different vehicles at the same time. In vehicular ad hoc networks (VANETs), the speed of a vehicle is changed from 10 to 40 m/s (36-144 km/h); therefore, the need for efficient authentication is inevitable. Compared with the current key agreement scheme, ABAKA can efficiently authenticate multiple requests by one verification operation and negotiate a session key with each vehicle by one broadcast message. Elliptic curve cryptography is adopted to reduce the verification delay and transmission overhead. The security of ABAKA is based on the elliptic curve discrete logarithm problem, which is an unsolved NP-complete problem. To deal with the invalid request problem, which may cause the batch verification fail, a detection algorithm has been proposed. Moreover, we demonstrate the efficiency merits of ABAKA through performance evaluations in terms of verification delay, transmission overhead, and cost for rebatch verifications, respectively. Simulation results show that both the message delay and message loss rate of ABAKA are less than that of the existing elliptic curve digital signature algorithm (ECDSA)-based scheme.
URI: http://dx.doi.org/10.1109/TVT.2010.2089544
http://hdl.handle.net/11536/26108
ISSN: 0018-9545
DOI: 10.1109/TVT.2010.2089544
期刊: IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume: 60
Issue: 1
起始頁: 248
結束頁: 262
Appears in Collections:Articles


Files in This Item:

  1. 000286385700023.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.