Secure message transmission in Vehicular Ad Hoc Networks (VANETs) is a challenging task due to its highly dynamic nature. In VANETs, road side unit (RSU) transmits different types of ser-vice messages to those vehicles, who have subscribed for that type of message. Intermediate vehicles, those are not subscribed to that service may also receive the message due to broadcast nature of wireless medium. Current literature on VANETs use conventional cryptography for secure message transmission. In this study, the secure service message delivery in VANETs is modeled as a co-operative quantum key distribution among nodes. In the proposed model, vehicles are interested in using services, that are provided by service providers (SPs) through RSUs after a vehicle registered for that service. A quantum key is distributed to registered vehi-cle through RSU, which is needed to unlock the service. RSU can transmit the quantum key to the vehicles, which are within its trans-mission range. A cooperative vehicle helps RSU to transmit the quantum key to a vehicle that is not in its transmission range. A network formation game is modeled for the proposed problem be-tween RSUs and vehicles to form network tree. Vehicles (nodes) use services, work as relay node in-order to cooperate with RSU to relay quantum key. In this paper, a distributed algorithm for cooper-ative quantum key distribution in VANETs (CQKDVN) is modeled, which helps RSU’s to choose a suitable relay node for quantum key distribution. The proposed algorithm, CQKDVN, helps nodes to decide whether to cooperate with a RSU or not based on the incentive it receives by serving a RSU to deliver quantum key to a destination node. CQKDVN also helps the RSU to adapt to the network topology changes such as a node move out of its range or movement of relay nodes that triggers to switch to a new relay node. CQKDVN constitute the network topology into a Nash network.
Secure message transmission in Vehicular Ad Hoc Networks (VANETs) is a challenging task due to its highly dynamic nature. In VANETs, road side unit (RSU) transmits different types of ser-vice messages to those vehicles, who have subscribed for that type of message. Intermediate vehicles, those are not subscribed to that service may also receive the message due to broadcast nature of wireless medium. Current literature on VANETs use conventional cryptography for secure message transmission. In this study, the secure service message delivery in VANETs is modeled as a co-operative quantum key distribution among nodes. In the proposed model, vehicles are interested in using services, that are provided by service providers (SPs) through RSUs after a vehicle registered for that service. A quantum key is distributed to registered vehi-cle through RSU, which is needed to unlock the service. RSU can transmit the quantum key to the vehicles, which are within its trans-mission range. A cooperative vehicle helps RSU to transmit the quantum key to a vehicle that is not in its transmission range. A network formation game is modeled for the proposed problem be-tween RSUs and vehicles to form network tree. Vehicles (nodes) use services, work as relay node in-order to cooperate with RSU to relay quantum key. In this paper, a distributed algorithm for cooper-ative quantum key distribution in VANETs (CQKDVN) is modeled, which helps RSU’s to choose a suitable relay node for quantum key distribution. The proposed algorithm, CQKDVN, helps nodes to decide whether to cooperate with a RSU or not based on the incentive it receives by serving a RSU to deliver quantum key to a destination node. CQKDVN also helps the RSU to adapt to the network topology changes such as a node move out of its range or movement of relay nodes that triggers to switch to a new relay node. CQKDVN constitute the network topology into a Nash network.
Many cryptographic techniques have been proposed to conceive a secure and privacy-oriented vehicular ad hoc network (VANET) for its practical deployment. The security of these techniques requires a common secret key to be shared between the communicating entities or depend upon the premise that some mathematical problems are computationally hard. However, because of the open nature of the wireless medium, the communication cannot be kept confidential and is prone to eavesdropping. Furthermore, with the arrival of quantum computers, these techniques are prone to quantum attacks—the time complexity of the assumed hard problem gets reduced from millions of years to a few seconds. In this paper, we propose a conditional privacy-preserving authentication scheme based on a quantum key distribution protocol for vehicle-to-infrastructure (V2I) communication. Our scheme inherits the properties of the quantum key distribution protocol. It does not require a secret authentication key to be transmitted conventionally and is resistant to quantum attacks. Apart from protecting VANETs against generic security threats, including node impersonation, message tampering, and repudiation, our scheme defends VANETs against man-in-the-middle attacks, replay attacks, etc. Besides, our protocol ensures message unlinkability, vehicle-identity privacy, and vehicle traceability if a vehicle misbehaves. The results obtained from the performance evaluation of our scheme confirm reasonable values of information leakage, key length, bit error probability, etc.
Vehicular ad hoc networks (VANETs) connect numerous vehicles, allowing efficient vehicle-to-vehicle communication through a dedicated network. The dynamic connectivity of VANETs facilitates spontaneous communication among diverse vehicles, enabling real-time exchange of crucial information like traffic conditions, road hazards, and other pertinent data. This collaborative network enhances road safety and traffic efficiency by enabling vehicles to share information and adapt to changing conditions in their proximity, ultimately improving the overall transportation system. This paper proposes an authentication protocol designed to be unconditionally secure against quantum attacks. The research delves into integrating quantum authentication with blockchain technology to establish a secure framework for VANETs. We introduce a quantum blockchain framework focused on bolstering the security of VANETs. The paper provides a thorough analysis of the potential of quantum blockchain in addressing common security threats in VANETs, including data tampering, eavesdropping, and unauthorized access.
This paper presents a thorough overview of both classical and quantum cryptography in Vehicular Ad Hoc Networks (VANETs), Which are becoming an increasingly important components of smart transportation system. As secure communication over these networks is crucial, this overview looks at recent advances in quantum cryptography in addition to a range of conventional cryptographic techniques, such as symmetric and asymmetric encryption. We analyze these methods in terms of security, effectiveness, and usability for VANET scenarios through review of the entirety of available literature. Additionally, we go over the particular security issues that VANETs present. As quantum computing capabilities advance, our analysis reveals the advantages and disadvantages of each cryptographic paradigm, providing insights into how classical cryptographic still offers workable solutions today while quantum cryptography hold promise for future proof security. The purpose of these observations is direct future studies and advancement in safe vehicle communication.
There is a need to ensure unconditionally secure communications between different sites of an organization. We use quantum key distribution (QKD) protocol to provide a continuous stream of secret key bits to each communicating pair for message encryption through one-time-pad (OTP) cryptography. Due to long distance between different sites, trusted nodes are used to relay each service key in a hop-by-hop manner from one end node to another end node of a communicating pair. In a QKD network, routes for key relaying can be affected by availability of relay key bits at trusted nodes. Also, relay key allocation among different routes can impact security. We consider the scenario of supporting multiple communicating pairs, where each pair demands delivery of a certain service key rate across the QKD network, and trusted nodes may not have sufficient relay key rates to perform bitwise encryption to protect the service key. Hence, there is a need to allocate the limited relay key bits to meet all service key delivery demands while considering its effects on security. We propose to perform jointly routing and relay key allocation to minimize attack success probability. We have formulated the joint problem as an optimization and further proposed an efficient algorithm to find the optimal solutions. We have evaluated the proposed algorithm to confirm its ability and efficiency in finding optimal routes and relay key allocations. For the specific network topology that we have adopted, results show that the minimum number of required trusted nodes increases linearly when end nodes are added to the system. Furthermore, we can achieve a higher security level by adding more trusted nodes in a QKD network. But increasing the number of trusted nodes beyond the minimum requirement may not continue to reduce significantly the attack success probability.
Communication in VANETs (Vehicular Ad-Hoc Network) is crucial when the vehicle is moving.Since these communications take place wirelessly without a direct physical connection, they are vulnerable to attacks such as spoofing, eavesdropping and message tampering.To protect these communications, various classical cryptographic algorithms are in use so that security breach is minimised.However, the algorithms focus on the complexity of the mathematical solution of problems, and such problems can be vulnerable to advanced quantum computing attacks, which makes them less suitable for required long-term quantum-resilient security.To address the challenges related with VANETs, this paper has introduced a new approach which is Quantum Key Distribution (QKD).In the proposed approach, QKD is used to securely establish the encryption key, while the actual messages are transmitted through the conventional classical communication system.In addition, Zero Trust verification is incorporated as an additional security layer, ensuring that communication entities are continuously verified before trusted communication is established.The paper implements and compares two security architectures in the CARLA 0.10.0 simulator: a classical RSA+ECC-based approach and a proposed QKD with Zero-Trust architecture using AES-256.Their communication latency and cryptographic processing time are evaluated to assess the suitability of QKD-based security for low-latency V2X communication.
The integration of unmanned aerial vehicles (UAVs) into vehicular ad hoc networks (VANETs) has emerged as a promising solution to overcome the limited coverage of conventional roadside unit (RSU)-based infrastructures. However, UAVs operate in open environments and cannot be fully trusted, while the rapid advancement of quantum computing threatens the long-term security of classical public-key cryptographic systems. As a result, many existing UAV-based VANET authentication schemes face fundamental limitations in future deployments. Most existing schemes either lack post-quantum security or incur excessive computational and communication overhead, making them unsuitable for real-time and high-mobility vehicular environments. In addition, the common assumptions of trusted UAVs do not align with realistic threat models. To address these issues, this paper proposes a lightweight post-quantum authentication and key exchange protocol based on the module learning with errors (MLWE) problem and physically unclonable functions (PUFs). The proposed scheme treats UAVs as untrusted relay nodes and excludes them from session key generation. Its security is evaluated using informal analysis, the real-or-random (RoR) model, BAN logic, and AVISPA, while performance evaluation indicates improved efficiency compared to existing schemes.