Journal
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 70, Issue 6, Pages 5974-5989Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2021.3078806
Keywords
Receivers; Vehicular ad hoc networks; Safety; Electronic mail; Public key cryptography; Privacy; Hash functions; Heterogeneous vehicular communication; Certificateless cryptosystem; Public key infrastructure; Signcryption; Bilinear pairing
Categories
Funding
- National Natural Science Foundation of China [61973331]
- National Key Research, and Development Plan Programs of China [2018YFB0106101]
Ask authors/readers for more resources
Vehicular ad-hoc networks (VANETs) are important for ensuring safety and efficiency in traffic management, but the heterogeneity in communication among vehicles from different manufacturers can lead to security and performance issues. This paper proposes a CP-CPPHSC scheme based on CLC and PKI, which enables secure message transmission and supports batch decryption for vehicles.
Vehicular ad-hoc networks (VANETs) enable vehicles to exchange safety information with the surrounding vehicles and infrastructure in order to ensure safety and efficiency in traffic management. Recently however, vehicles come from different manufacturers and therefore use different protocols for the transmission of messages. As a result, communication among vehicles become heterogeneous. Because of this, VANETs face problems related to security and performance. To address this, some heterogeneous vehicular communication-based schemes have been proposed. However, they do not perform well because of an increase in computational overhead. In order to resolve this, we propose a certificateless cryptosystem (CLC) and public key infrastructure (PKI)-based conditional privacy-preserving hybrid signcryption (CP-CPPHSC) scheme. This scheme utilizes bilinear pairings and provides security requirements in a single logical step. Through the CP-CPPHSC scheme, a message is transmitted by a vehicle using the CLC to a vehicle using the PKI. Additionally, the CP-CPPHSC scheme supports the batch unsigncryption method which helps a vehicle to unsigncrypt more than one messages simultaneously. In the random oracle model (ROM), our scheme ensures existential unforgeability against adaptive chosen message attack (EUF-CMA) with respect to a hardness assumption of q-strong Diffie-Hellman (q-SDH) and modified inverse computational Diffie-Hellman (mICDH) problems and indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) with respect to a hardness assumption of q-bilinear Diffie-Hellman inversion (q-BDHI) problem. Our scheme effectively reduces computational cost when compared to state-of-the-art schemes without an increase in the communication cost.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available