Open Access

ARTICLE

An Efficient Certificateless Aggregate Signature Scheme Designed for VANET

by Cui Li, Gang Wu, Lipeng Xing, Feng Zhu, Liang Zhao

1 College of Information and Communication, National University of Defense Technology, Xi’an, China.
2 Ansys, Southpointe 2600 ANSYS Drive Canonsburg, Commonwealth of Pennsylvania, 15317, USA.

* Corresponding Author: Cui Li. Email: .

Computers, Materials & Continua 2020, 63(2), 725-742. https://doi.org/10.32604/cmc.2020.07188

Received 06 May 2019; Accepted 04 June 2019; Issue published 01 May 2020

Abstract

The Vehicular Ad-hoc Network (VANET) is the fundamental of smart transportation system in the future, but the security of the communication between vehicles and vehicles, between vehicles and roadside infrastructures have become increasingly prominent. Certificateless aggregate signature protocol is used to address this security issue, but the existing schemes still have many drawbacks in terms of security and efficiency: First, many schemes are not secure, and signatures can be forged by the attacker; Second, even if some scheme are secure, many schemes use a large number of bilinear pairing operation, and the computation overhead is large. At the same time, the length of the aggregated signature also increases linearly with the increase of user numbers, resulting in a large communication overhead. In order to overcome the above challenges, we propose a new certificateless aggregate signature scheme for VANET, and prove the security of the scheme under the random oracle model. The new scheme uses pseudonym to realize the conditional privacy protection of the vehicle’s information. The new scheme does not use bilinear pairing operation, and the calculation efficiency is high. At the same time, the length of the aggregate signature of the new scheme is constant, thereby greatly reducing the communication and storage overhead. The analysis results demonstrate that the new scheme is not only safer, but also superior in performance to the recent related schemes in computation overhead and communication cost.

---

Keywords

---