Computationally efficient privacy preserving authentication and key distribution techniques for vehicular ad hoc networks

Providing an efficient anonymous authentication scheme in vehicular ad hoc networks (VANETs) with low computational cost is a challenging issue. Even though, there are some existing schemes to provide anonymous authentication, the existing schemes suffer from high computational cost in the certificate and the signature verification process, which leads to high message loss. Therefore, they fail to meet the necessity of verifying hundreds of messages per second in VANETs. In our scheme, we propose an efficient anonymous authentication scheme to avoid malicious vehicles entering into the VANET. In addition, the proposed scheme offers a conditional tracking mechanism to trace the vehicles or roadside units that abuse the VANET. As a result, our scheme revokes the privacy of misbehaving vehicles to provide conditional privacy in a computationally efficient way through which the VANET entities will be anonymous to each other until they are revoked from the VANET system. Moreover, the proposed scheme is implemented and the performance analysis shows that our scheme is computationally efficient with respect to the certificate and the signature verification process by keeping conditional privacy in VANETs.

In order to protect the user's privacy identity, authentication requires anonymous authentication. Anonymous authentication is divided into unconditional anonymous authentication and traceable anonymous authentication. Unconditional anonymous authentication can verify that the user belongs to an anonymous set, but the user's true identity cannot be obtained. However, in some applications, it is necessary to trace the true identity of the user. Therefore, a traceable anonymous authentication scheme is proposed. In order to prevent random tracing, the proposed scheme uses threshold joint tracing. When the identity of the authenticator needs to be traced, the threshold number of members can jointly trace the identity of the authenticator. In some special network applications such as anonymous electronic voting, in order to prevent repeated authentications and repeated elections, it is necessary to verify whether the two authentication signatures are signed by the same user without revealing the true identity of the user. Therefore, the proposed anonymous authentication scheme should have selective linkability. In order to achieve linkable authentication, the linkable tag is embedded by linkable ring signature. Compared with similar schemes through the simulation experiments, the implementation time of the proposed scheme is slightly better than other schemes.

For telematics applications, entity authentication between vehicles and roadside units (RSUs) with vehicle anonymity plays an important role on providing security and privacy. In 2009, Yim, Choi, and Kim proposed an anonymous authentication protocol in Vehicular Ad-hoc Networks (VANETs) for communications between vehicles and RSUs. The Yim-Choi-Kim scheme employs a traceable ring signature with t-times anonymity as a building block. The t-times anonymity is for the privacy requirement of movement tracking avoidance, however, it has a weakness in the strong unlinkability property. This paper improves the weakness of the Yim-Choi-Kim scheme.

Vie des Entreprises

The vehicular ad-hoc network (VANET) is a promising technology in near future. VANET allows vehicles to communicate with each other and with roadside units (RSUs). Wireless Access in Vehicular Environment (WAVE), defined by IEEE, provides the Internet connectivity for vehicles as well as vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. RSUs can form a wireless mesh network (WMN) as a backbone infrastructure to enhance the performance of VANET. However, WAVE supports only one-hop communications for IP packets in VANET, and existing researches do not consider the compatibility between VANET and WMN infrastructure formed by RSUs. We propose the extended WMN (ExWMN) which has the feasibility to extend WMN to VANET domain. In ExWMN, the vehicles can send IP packets to an access router by using the multi-hop capability of WMN. ExWMN uses the addressing scheme of WMN for the extended VANET domain and exploits geographical routing protocols instead of existing routing protocols of WMN due to VANET characteristics such as mobility and dynamically changing network topologies. ExWMN supports the compatibility between the extended VANET and a WMN infrastructure due to RSUs, which provide a bridging function between them. This paper presents the architecture and the detailed procedures of the ExWMN.

Context-aware anonymous authentication protocols in the internet of things dedicated to e-health applications

Recently, the platoon-based vehicular cyber-physical system (VCPS) has attracted significant attention. The members of platoon may change quite dynamically, and vehicles may join or leave the platoon at any time. Therefore, how to securely set up a group and guarantee anonymity of platoon members when performing authentication with road side units (RSUs) along the highway is a challenge. To address this issue, in this paper, we propose a secure group setup and anonymous authentication scheme in the platoon-based VCPS by using a special group signature technique, named SGSA. The proposed SGSA can securely set up a temporary platoon, and flexibly support platoon merging/platoon splitting. Particularly, once a dispute occurs on an access request during the authentication, any platoon member can trace the corresponding vehicle of the disputed access request message. Finally, we also carry out extensive analysis to show the security and efficiency of our proposed SGSA.

Nowadays, the research on vehicular ad hoc networks (VANETs) remains a hot topic within the Internet of Things (IoT) scenarios. Diverse studies and techniques regarding all aspects of VANETs have been investigated thoroughly. Particularly, the wireless characteristic of heterogeneous vehicular communication, along with the complicated and dynamic connection topology among participating VANET entities, have severely affected the secure and stable data exchange. Specifically, the spontaneous vehicle-to-vehicle (V2V) message dissemination, as the essential functionality of VANET, plays a significant role for instant and real-time data sharing for vehicles within a certain vicinity. However, with the short-time interaction and high mobilization of vehicular connections, the remote V2V message delivery intended for long-distance vehicles in the range of different roadside units (RSUs) has not been properly researched. Meanwhile, both V2V and V2R (Vehicle-to-RSU) communication are highly restricted by environmental factors such as physical obstructions or signal interferences, thus drastically reducing the wireless connectivity in practical VANET implementations. In this case, the unmanned aerial vehicles (UAVs), as the auxiliary facilities, can provide the VANET with substitute wireless routes, so that the transmission quality and availability can be improved. In this paper, the authenticated UAV group association design is proposed at first. On this basis, the remote V2V message dissemination method is enabled, where the decentralized V2V connections involving all RSUs along the way are provided. The analysis regarding crucial security properties is presented accordingly, where the formal proofs and comparison are conducted. Moreover, the performance evaluation in terms of storage and time consumption during RSU authentication process is illustrated, respectively. Comparison results with the state-of-the-art prove that superiority on the major performance factors can be achieved.

The roadside unit (RSU) is one of the fundamental components in a vehicular ad hoc network (VANET), where a vehicle communicates in infrastructure mode. The RSU has multiple functions, including the sharing of emergency messages and the updating of vehicles about the traffic situation. Deploying and managing a static RSU (sRSU) requires considerable capital and operating expenditures (CAPEX and OPEX), leading to RSUs that are sparsely distributed, continuous handovers amongst RSUs, and, more importantly, frequent RSU interruptions. At present, researchers remain focused on multiple parameters in the sRSU to improve the vehicle-to-infrastructure (V2I) communication; however, in this research, the mobile RSU (mRSU), an emerging concept for sixth-generation (6G) edge computing vehicular ad hoc networks (VANETs), is proposed to improve the connectivity and efficiency of communication among V2I. In addition to this, the mRSU can serve as a computing resource for edge computing applications. This paper proposes a novel energy-efficient reservation technique for edge computing in 6G VANETs that provides an energy-efficient, reservation-based, cost-effective solution by introducing the concept of the mRSU. The simulation outcomes demonstrate that the mRSU exhibits superior performance compared to the sRSU in multiple aspects. The mRSU surpasses the sRSU with a packet delivery ratio improvement of 7.7%, a throughput increase of 5.1%, a reduction in end-to-end delay by 4.4%, and a decrease in hop count by 8.7%. The results are generated across diverse propagation models, employing realistic urban scenarios with varying packet sizes and numbers of vehicles. However, it is important to note that the enhanced performance parameters and improved connectivity with more nodes lead to a significant increase in energy consumption by 2%.

Emerging as the effective strategy of intelligent transportation system (ITS), vehicular ad hoc networks (VANETs) have the capacity of drastically improving the driving experience and road safety. In typical VANET scenarios, high mobility and volatility of vehicles result in dynamic topology of vehicular networks. That is, individual vehicle may pass through the effective domain of multiple neighboring road-side-units (RSUs) during a comparatively short time interval. Hence, efficient and low-latency cross-domain verification with all the successive RSUs is of significance. Recently, a lot of research on VANET authentication and key distribution was presented, while the critical cross-domain authentication (CDA) issue has not been properly addressed. Particularly, the existing CDA solutions mainly reply on the acquired confidential keying information from the neighboring entities (RSUs and vehicles), while too much trustworthiness is granted to the involved RSUs. Please note that the RSUs are distributively located and may be compromised or disabled by adversary, thus vital vehicle information may be revealed. Furthermore, frequent data interactions between RSUs and cloud server are always the major requisite so as to achieve mutual authentication with cross-domain vehicles, which leads to heavy bandwidth consumption and high latency. In this paper, we address the above VANET cross-domain authentication issue under the novel RSU edge networks assumption. Please note that RSUs are assumed to be semi-trustworthy entity in our design, where critical vehicular keying messages remain secrecy. Homomorphic encryption design is applied for all involved RSUs and vehicles. In this way, successive RSUs could efficiently verify the cross-domain vehicle with the transited certificate from the neighbor RSUs and vehicle itself, while the identity and secrets of each vehicle is hidden all the time. Afterwards, dynamic updating towards the anonymous vehicle identity is conducted upon validation, where conditional privacy preserving is available. Moreover, pairing-free mutual authentication method is used for efficiency consideration. Formal security analysis is given, proving that the HCDA mechanism yields desirable security properties on VANET cross domain authentication issue. Performance discussions demonstrate efficiency of the proposed HCDA scheme compared with the state-of-the-art.

Vehicular ad hoc networks have played a key role in intelligent transportation systems that considerably improve road safety and management. This new technology allows vehicles to communicate and share road information. However, malicious users may inject false emergency alerts into vehicular ad hoc networks, preventing nodes from accessing accurate road information. In order to assure the reliability and trustworthiness of information through the networks, assessing the credibility of nodes has become a critical task in vehicular ad hoc networks. A new scheme for malicious node detection is proposed in this work. Multiple factors are fed into a fuzzy logic model for evaluating the trust for each node. Vehicles are divided into clusters in our approach, and a road side unit manages each cluster. The road side unit assesses the credibility of nodes before accessing vehicular ad hoc networks. The road side unit evicts a malicious node based on trust value. Simulations are used to validate our technique. We demonstrate that our scheme can detect and evict all malicious nodes in the vehicular ad hoc network over time, lowering the ratio of malicious nodes. Furthermore, it has a positive impact on selfish node participation. The scheme increases the success rate of delivered data to the same level as the ideal cases when no selfish node is present.

With the development of the vehicular communications technology, roadside units (RSUs) placement problem has recently received considerable attentions in vehicular ad hoc networks (VANETs). This paper addresses the roadside units (RSUs) placement problem for traffic flow coverage requirement number in vehicular ad hoc networks (VANETs). Given a set of road segments, some traffic flows and a coverage requirement number n, the problem is how to find the optimal placement of RSUs, such that each traffic flow is covered by at least n RSUs. We first investigate full RSUs placement problem, which place all the RSUs on the given road segments totally. We prove that this problem is NP-hard. Then, we propose a greedy algorithm to solve the problem and theoretical analysis is given. We also study incremental RSUs placement problem, which place the partial RSUs based on the deployed RSUs on the given road segments. Based on the proposed greedy algorithm, we also propose a algorithm to solve the incremental RSUs placement problem. Extensive simulations have been conducted to show the performance of our proposed algorithms is superior to the other algorithms.

Vehicular ad hoc networks (VANETs) are proposed to improve the traffic safety and efficiency through communications among vehicles and between vehicle and roadside units (RSUs). When a vehicle broadcasts messages to nearby vehicles and roadside units (RSUs), it needs to resist attacks and to preserve the privacy of the message senders. Therefore, security and privacy issues are of great interests and remain challenging. Many authentication schemes are proposed to tackle above challenges while most of them are heavy in computation and communication. In this paper, we propose a novel authentication scheme that utilizes the double pseudonym method to hide the real identity of vehicle and adopts the dynamic update technology to periodically update the information (such as member secret, authentication key, internal pseudo-identity) stored in the tamper-proof device (TPD) to prevent the side-channel attack. Because of not using bilinear pairing, our scheme yields a better performance in terms of computation overhead and communication overhead and is more suitable to be applied in VANETs.

Vehicular Ad Hoc Network (VANET) is a special application of traditional Mobile Ad Hoc Network (MANET) in traffic roads, which has attracted extensive attention due to its important role in intelligent traffic and road services. In order to ensure the safety of road traffic and protect the privacy of users, it is of vital importance to provide effective anonymous authentication in VANET. In this paper, we propose an efficient mutual authentication framework with conditional privacy protection (EMAPP), which can achieve the security authentication from vehicles to infrastructure and vehicles to vehicles. In the proposed framework, we are combined with pseudo ID and temporary pseudonym to protect the privacy of vehicles, and use the identity-based signature scheme to achieve authentication between vehicles and infrastructure. At the same time, with the assistance of the roadside unit (RSU), we utilize an online/offline signature scheme to achieve authentication between vehicles in the same RSU area and different RSU area. Our scheme has reusability, and we have conducted a performance evaluation. Without expensive and time-consuming operations such as bilinear pairing and mapping to point (MTP) functions, our framework can produce better performance and is appropriate for practical application. In addition, we also use the Internet Security Protocol and Application Automatic Authentication (AVISPA) tools to provide formal security analysis.

HCPA-GKA: A hash function-based conditional privacy-preserving authentication and group-key agreement scheme for VANETs