IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v15y2023i8p266-d1214798.html
   My bibliography  Save this article

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

Author

Listed:
  • 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
    Department of Car Transport Operation and Car Service, North-Eastern Federal University, St. Belinsky, 58, 677000 Yakutsk, Russia)

  • Fazal Noor

    (Department of Computer and Information Systems, Islamic University of Madinah, Madinah 400411, Saudi Arabia)

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.

Suggested Citation

  • Asad Iqbal & Muhammad Zubair & Muhammad Asghar Khan & Insaf Ullah & Ghani Ur-Rehman & Alexey V. Shvetsov & Fazal Noor, 2023. "An Efficient and Secure Certificateless Aggregate Signature Scheme for Vehicular Ad hoc Networks," Future Internet, MDPI, vol. 15(8), pages 1-16, August.
  • Handle: RePEc:gam:jftint:v:15:y:2023:i:8:p:266-:d:1214798
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/15/8/266/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/15/8/266/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Eko Fajar Cahyadi & Tzu-Wei Su & Chou-Chen Yang & Min-Shiang Hwang, 2022. "A certificateless aggregate signature scheme for security and privacy protection in VANET," International Journal of Distributed Sensor Networks, , vol. 18(5), pages 15501329221, May.
    2. Insaf Ullah & Muhammad Asghar Khan & Mohammed H. Alsharif & Rosdiadee Nordin, 2021. "An Anonymous Certificateless Signcryption Scheme for Secure and Efficient Deployment of Internet of Vehicles," Sustainability, MDPI, vol. 13(19), pages 1-19, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Le Zhang & Lijing Lyu & Shanshui Zheng & Li Ding & Lang Xu, 2022. "A Q-Learning-Based Approximate Solving Algorithm for Vehicular Route Game," Sustainability, MDPI, vol. 14(19), pages 1-14, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:15:y:2023:i:8:p:266-:d:1214798. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.