中国邮电高校学报(英文) ›› 2018, Vol. 25 ›› Issue (1): 85-94.doi: 10.19682/j.cnki.1005-8885.2018.0010

• Others • 上一篇    

Efficient pairing-based batch anonymous authentication scheme for VANET

宋成,张明月,彭维平   

  1. 河南理工大学
  • 收稿日期:2017-07-17 修回日期:2018-01-13 出版日期:2018-02-28 发布日期:2018-02-28
  • 通讯作者: 张明月 E-mail:zhangmingyue0118@163.com
  • 基金资助:
    国家自然科学基金青年基金项目;国家自然科学基金青年基金项目;河南省科技攻关计划

Efficient pairing-based batch anonymous authentication scheme for VANET

  • Received:2017-07-17 Revised:2018-01-13 Online:2018-02-28 Published:2018-02-28

摘要: To solve the efficiency problem of batch anonymous authentication for vehicular Ad-hoc networks (VANET), an improved scheme is proposed by using bilinear pairing on elliptic curves. The signature is jointly generated by roadside unit(RSU) node and vehicle, thus reducing the burden of VANET certification center and improving the authentication efficiency, and making it more difficult for attacker to extract the key. Furthermore, under random oracle model (ROM) security proof is provided. Analyses show that the proposed scheme can defend against many kinds of security problems, such as anonymity, man-in-the-middle  (MITM) attack, collusion attack, unforgeability, forward security and backward security etc., while the computational overheads are significantly reduced and the authentication efficiency is effectively improved. Therefore, the scheme has great theoretical significance and application value under computational capability constrained internet of things (IoT) environments.

关键词: bilinear pairing, anonymous authentication, privacy protection, vehicular Ad-hoc networks, random oracle model

Abstract: To solve the efficiency problem of batch anonymous authentication for vehicular Ad-hoc networks (VANET), an improved scheme is proposed by using bilinear pairing on elliptic curves. The signature is jointly generated by roadside unit(RSU) node and vehicle, thus reducing the burden of VANET certification center and improving the authentication efficiency, and making it more difficult for attacker to extract the key. Furthermore, under random oracle model (ROM) security proof is provided. Analyses show that the proposed scheme can defend against many kinds of security problems, such as anonymity, man-in-the-middle (MITM) attack, collusion attack, unforgeability, forward security and backward security etc., while the computational overheads are significantly reduced and the authentication efficiency is effectively improved. Therefore, the scheme has great theoretical significance and application value under computational capability constrained internet of things (IoT) environments.

Key words: bilinear pairing, anonymous authentication, privacy protection, vehicular Ad-hoc networks, random oracle model