An Efficient and Secure Certificateless Aggregate Signature Scheme for Vehicular Ad hoc Networks

Asad Iqbal, Muhammad Zubair, Muhammad Asghar Khan, Insaf Ullah, Ghani Ur-Rehman, Alexey V. Shvetsov () and Fazal Noor ()
Additional contact information
Asad Iqbal: Department of Computer Science, Khushal Khan Khattak University, Karak 27200, Pakistan
Muhammad Zubair: Department of Computer Science, Khushal Khan Khattak University, Karak 27200, Pakistan
Muhammad Asghar Khan: Faculty of Engineering Sciences and Technology, Hamdard University, Islamabad 44000, Pakistan
Insaf Ullah: Faculty of Engineering Sciences and Technology, Hamdard University, Islamabad 44000, Pakistan
Ghani Ur-Rehman: Department of Computer Science, Khushal Khan Khattak University, Karak 27200, Pakistan
Alexey V. Shvetsov: Department of Smart Technologies, Moscow Polytechnic University, St. Bolshaya Semenovskaya, 38, 107023 Moscow, Russia
Fazal Noor: Department of Computer and Information Systems, Islamic University of Madinah, Madinah 400411, Saudi Arabia

Future Internet, 2023, vol. 15, issue 8, 1-16

Abstract: Vehicular ad hoc networks (VANETs) have become an essential part of the intelligent transportation system because they provide secure communication among vehicles, enhance vehicle safety, and improve the driving experience. However, due to the openness and vulnerability of wireless networks, the participating vehicles in a VANET system are prone to a variety of cyberattacks. To secure the privacy of vehicles and assure the authenticity, integrity, and nonrepudiation of messages, numerous signature schemes have been employed in the literature on VANETs. The majority of these solutions, however, are either not fully secured or entail high computational costs. To address the above issues and to enable secure communication between the vehicle and the roadside unit (RSU), we propose a certificateless aggregate signature (CLAS) scheme based on hyperelliptic curve cryptography (HECC). This scheme enables participating vehicles to share their identities with trusted authorities via an open wireless channel without revealing their identities to unauthorized participants. Another advantage of this approach is its capacity to release the partial private key to participating devices via an open wireless channel while keeping its identity secret from any other third parties. A provable security analysis through the random oracle model (ROM), which relies on the hyperelliptic curve discrete logarithm problem, is performed, and we have proven that the proposed scheme is unforgeable against Type 1 ( F G R 1 ) and Type 2 ( F G R 2 ) forgers. The proposed scheme is compared with relevant schemes in terms of computational cost and communication overhead, and the results demonstrate that the proposed scheme is more efficient than the existing schemes in maintaining high-security levels.

Keywords: vehicular ad hoc network; security; certificateless aggregate signature; hyperelliptic curve cryptography (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/15/8/266/pdf (application/pdf)
https://www.mdpi.com/1999-5903/15/8/266/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:15:y:2023:i:8:p:266-:d:1214798

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().