Abstract:Vehicle in vehicular ad hoc networks (VANETs) broadcasts beacons about their traffic status wirelessly for improving traffic safety and efficiency. Before deployment of the VANET system, problems related to security and privacy should be carefully addressed. In this paper, we propose a lightweight authentication with conditional privacy-preserving scheme for guaranteeing secure communication in VANET. The proposed scheme is suitable for addressing issues related to security and privacy because it combines the … Show more
“…To overcome the time-consuming operations of ID-based BP approaches, He et al [32] proposed an ID-based elliptic curve (EC) Cryptography to provide a signature verification process for vehicular communication. Recently, some authentication schemes based on EC have been proposed by [32][33][34][35][36][37][38][39] to tackle privacy and security proprieties for vehicular communication. Nevertheless, the operations of EC are time-consuming with an increase in the number of participating nodes.…”
The security and privacy concerns in vehicular communication are often faced with schemes depending on either elliptic curve (EC) or bilinear pair (BP) cryptographies. However, the operations used by BP and EC are time-consuming and more complicated. None of the previous studies fittingly tackled the efficient performance of signing messages and verifying signatures. Therefore, a chaotic map-based conditional privacy-preserving authentication (CM-CPPA) scheme is proposed to provide communication security in 5G-enabled vehicular networks in this paper. The proposed CM-CPPA scheme employs a Chebyshev polynomial mapping operation and a hash function based on a chaotic map to sign and verify messages. Furthermore, by using the AVISPA simulator for security analysis, the results of the proposed CM-CPPA scheme are good and safe against general attacks. Since EC and BP operations do not employ the proposed CM-CPPA scheme, their performance evaluation in terms of overhead such as computation and communication outperforms other most recent related schemes. Ultimately, the proposed CM-CPPA scheme decreases the overhead of computation of verifying the signatures and signing the messages by 24.2% and 62.52%, respectively. Whilst, the proposed CM-CPPA scheme decreases the overhead of communication of the format tuple by 57.69%.
“…To overcome the time-consuming operations of ID-based BP approaches, He et al [32] proposed an ID-based elliptic curve (EC) Cryptography to provide a signature verification process for vehicular communication. Recently, some authentication schemes based on EC have been proposed by [32][33][34][35][36][37][38][39] to tackle privacy and security proprieties for vehicular communication. Nevertheless, the operations of EC are time-consuming with an increase in the number of participating nodes.…”
The security and privacy concerns in vehicular communication are often faced with schemes depending on either elliptic curve (EC) or bilinear pair (BP) cryptographies. However, the operations used by BP and EC are time-consuming and more complicated. None of the previous studies fittingly tackled the efficient performance of signing messages and verifying signatures. Therefore, a chaotic map-based conditional privacy-preserving authentication (CM-CPPA) scheme is proposed to provide communication security in 5G-enabled vehicular networks in this paper. The proposed CM-CPPA scheme employs a Chebyshev polynomial mapping operation and a hash function based on a chaotic map to sign and verify messages. Furthermore, by using the AVISPA simulator for security analysis, the results of the proposed CM-CPPA scheme are good and safe against general attacks. Since EC and BP operations do not employ the proposed CM-CPPA scheme, their performance evaluation in terms of overhead such as computation and communication outperforms other most recent related schemes. Ultimately, the proposed CM-CPPA scheme decreases the overhead of computation of verifying the signatures and signing the messages by 24.2% and 62.52%, respectively. Whilst, the proposed CM-CPPA scheme decreases the overhead of communication of the format tuple by 57.69%.
“…Pseudonym-based schemes were proposed [35]- [41] by using cryptographic operations associated with elliptic curve cryptography to sign and verify the traffic-related messages. He et al [35] were the first to propose the use of the elliptic curve cryptography rather than bilinear pair cryptography to achieve security and privacy requirements in 2015.…”
Section: ) Elliptic Curve Cryptographymentioning
confidence: 99%
“…In this section, we analysis a performance evaluation in terms of computation and communication overheads and give a comparison with most recent existing schemes [41]- [43] for 5G-enabled vehicular networks. The scheme in this paper uses the experiment in [50] to run on a macOS High Sierra operation system consists of an Intel Core i5 processor with, 4 GB RAM and 1.6 GHz clock frequency.…”
Section: Performance Analysis and Comparisonmentioning
Traffic safety and efficiency are extremely significant in both private and public transportation. The fifth-generation (5G)-enabled vehicular networks works wirelessly to share information among vehicles for helping drivers and passengers. Since the vehicle broadcasts the traffic status messages, privacy and security are considered as a challenging issue in 5G-enabled vehicular networks. In order to satisfy these privacy and security requirements, many privacy-preserving and security attacks schemes have been proposed. Nevertheless, since these schemes use a complex elliptic curve and bilinear pair cryptography operations, the performance efficiency of in terms of communication and computational costs is not satisfactory, which denial of service (DoS) attacks occurs. To address this, this paper proposes modular square root-based to resist denial of service (DoS) attacks (MSR-DoS) scheme in 5G-enabled vehicular networks. Our MSR-DoS scheme satisfies authenticity of source, integrity of message, pseudonym privacypreserving, unlinkable, traceable and revocable in vehicular networks. The security of our work is proved under burrows abadi needham (BAN) logic. The performance analysis and comparison shows that MSR-DoS scheme has less communication and computational costs as compared to the most recent existing works. Meanwhile, the proposed MSR-DoS scheme reduces the computation overhead of signing the message and verifying the message by 99.80% and 98.55%, respectively.
“…The Chebyshev Polynomial T ω (ϕ) of degree ω is defined as indicated in (1). Its recurrence formula can be specified according to (2).…”
Section: A Cryptographic Toolsmentioning
confidence: 99%
“…Due to the massive deployment of intelligent transportation system (ITS) in smart cities, the vehicular adhoc network (VANET) has attracted a deliberate attention in the research domain; the major goals of VANET are to support numerous applications in terms of infotainment, emergency, and traffic safety services [1], [2]. In general, VANET structure has three main components as follows: Firstly, onboard units (OBUs) mounted on vehicles to allow them connect…”
It is crucial to support emergency applications provided by vehicular adhoc network (VANET) through enabling vehicles to quickly access to the infrastructure and consequently request rescue services. Additionally, the communication channels between vehicles and the infrastructure lack various security features due to the inferior wireless characteristics of their environment. However, most of the existing authentication schemes which are used to fix the security drawbacks lead to heavy computations and large storage burdens on the vehicle onboard unit (OBU). These schemes utilize secure channels while distributing the network parameters between the various participants. Yet, it is not efficient to establish secure channels during the interactions between entities. Furthermore, lightweight cryptography is an efficient security solution which is adequate for OBU to maintain a reasonable efficiency with low computational and communication costs. Two basic demerits for lightweight authentication protocols are highlighted as follows: Firstly, symmetric key-based authentication protocols dismiss achieving non-repudiation feature, leading to several security attacks in VANET. Secondly, public key-based authentication schemes are relied on elliptic curve cryptography (ECC) which makes the protocol implementation more difficult. Hence, this paper introduces a novel authentication protocol that utilizes Chebyshev chaotic maps to secure connectivity between the vehicles and infrastructure without using secure channels to distribute the network parameters. The new protocol combines the concept of the symmetric key cryptography with the public key signature to satisfy both the lightweight property and non-repudiation feature. Thus, this protocol introduces a novel network model which is the lowest hardware complexity, compared with others. The performance analysis is performed by Wolfram Mathematica, proving that the proposed protocol is superior in terms of security and performance aspects; its computation and storage costs of OBU are enhanced with 24.09% and 16.99%, respectively, compared to the most competing scheme. Besides, the Scyther simulation confirms the security of the protocol.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.