Abstract:In this paper, we introduce an efficient and dynamic elliptic curve qu-vanstone implicit certificates distribution scheme for vehicular cloud networks. We are concerned about how to achieve efficiently and dynamically certificates distribution with a reduced cost. We design an efficient mechanism that reduces the communication cost and the computational overhead for more safety and robustness of intelligent transportation systems. Our proposal enables vehicles to request and obtain implicit certificates upon a… Show more
“…For instance, we consider n = 128 and we implement a (n, k) = (128, 75) polar code with 11 bits CRC and a (127, 64, 10) BCH code. Also, we pick regular (3,6) LDPC codes with length 128 bits 2 . In Fig.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…4. In fact, this lightweight proximity estimation approach allows Alice to detect impersonation attacks 3 when used in combination with the authentication protocol presented in the next section.…”
Section: Fast Proximity Estimationmentioning
confidence: 99%
“…However, the low latency and computational power constraints present in many IoT systems [2], render the design of IoT authentication mechanisms a challenging task. Current solutions rely on modulo arithmetic in large fields and typically incur considerable latency, in the order of tens of milliseconds; as an example, it has been reported that verifying digital signatures on a vehicle with a 400 MHz processor takes around 20 msec [3], exceeding the delays that are tolerated in vehicle to everything (V2X) communications. In this direction, a 3GPP report on the security of ultra reliable low latency communication (URLLC) systems notes that authentication for URLLC is still an open problem [4].…”
Lightweight and low latency security mechanisms are becoming increasingly important for a wide range of Internet of things (IoT) applications. Promising schemes from the physical layer include (i) physical unclonable functions (PUFs), (ii) localization based authentication, and, (iii) secret key generation (SKG) from wireless fading coefficients. In this paper, we focus on short blocklengths and propose a complete, fast, multi-factor authentication protocol that uniquely combines PUFs, proximity estimation and SKG. To demonstrate the performance of the SKG scheme in the short blocklength (with a focus on delay constrained applications), we provide a numerical comparison of three families of channel codes, including low density parity check codes (LDPC), Bose Chaudhuri Hocquenghem (BCH), and, Polar codes. The SKG keys are incorporated in a zeroround-trip-time resumption protocol for fast re-authentication. All schemes of the proposed mutual authentication protocol are shown to be secure through formal proofs using Burrows, Abadi and Needham (BAN) and Mao and Boyd (MB) logic as well as the Tamarin-prover.
“…For instance, we consider n = 128 and we implement a (n, k) = (128, 75) polar code with 11 bits CRC and a (127, 64, 10) BCH code. Also, we pick regular (3,6) LDPC codes with length 128 bits 2 . In Fig.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…4. In fact, this lightweight proximity estimation approach allows Alice to detect impersonation attacks 3 when used in combination with the authentication protocol presented in the next section.…”
Section: Fast Proximity Estimationmentioning
confidence: 99%
“…However, the low latency and computational power constraints present in many IoT systems [2], render the design of IoT authentication mechanisms a challenging task. Current solutions rely on modulo arithmetic in large fields and typically incur considerable latency, in the order of tens of milliseconds; as an example, it has been reported that verifying digital signatures on a vehicle with a 400 MHz processor takes around 20 msec [3], exceeding the delays that are tolerated in vehicle to everything (V2X) communications. In this direction, a 3GPP report on the security of ultra reliable low latency communication (URLLC) systems notes that authentication for URLLC is still an open problem [4].…”
Lightweight and low latency security mechanisms are becoming increasingly important for a wide range of Internet of things (IoT) applications. Promising schemes from the physical layer include (i) physical unclonable functions (PUFs), (ii) localization based authentication, and, (iii) secret key generation (SKG) from wireless fading coefficients. In this paper, we focus on short blocklengths and propose a complete, fast, multi-factor authentication protocol that uniquely combines PUFs, proximity estimation and SKG. To demonstrate the performance of the SKG scheme in the short blocklength (with a focus on delay constrained applications), we provide a numerical comparison of three families of channel codes, including low density parity check codes (LDPC), Bose Chaudhuri Hocquenghem (BCH), and, Polar codes. The SKG keys are incorporated in a zeroround-trip-time resumption protocol for fast re-authentication. All schemes of the proposed mutual authentication protocol are shown to be secure through formal proofs using Burrows, Abadi and Needham (BAN) and Mao and Boyd (MB) logic as well as the Tamarin-prover.
“…The ECQV mechanism is typically applied in IoT contexts [8], [9], which is also a domain characterized by its constrained nature. A concrete applications of ECQV implicit certificates for the vehicular networks is presented in [10], [11] utilizing the advantage of smaller size of the certificate. Ethereum is the first smart contract based innovation which is explained in [17].…”
Internet of Things (IoT) is a key topic of interest in modern communication context with the evolution of 5G and beyond ecosystems. 5G will interconnects billions of IoT devices wirelessly. The wireless communication exposes the devices to massive security risks in different dimensions. The Public Key Infrastructure (PKI) is one of the promising solutions to eliminate security risks. It ensures the authentication and communication integrity by using public key certificates. However, the overhead of certificate storage is a significant problem for the resource constrained IoT devices. We propose an application of Elliptic Curve Qu Vanstone (ECQV) certificates, which are lightweight in size for the resource restricted IoT devices. Furthermore, we incorporate the blockchain based smart contracts to handle the certificate related operations. We utilize the smart contracts in the certificate issuance and developed a smart contract based threat scoring mechanism to automatically revoke the certificates. The lightweight nature of ECQV certificates enables the distributed ledger to store, update, and revoke the certificates. We evaluated the proposed solution in Hyperledger Fabric blockchain platform.
“…Most of the algorithms are believed that static pseudonyms changing place have a fixed position once they are deployed . But there are some applications like search and rescue, wildlife tracking, habitat monitoring, and velocity‐based navigation systems that need mobility among vehicle nodes . Based on the application, nodes, as well as sink, can be mobile vehicles.…”
Summary
To improve the fairness, the energy consumption changing pseudonyms needs to be taken into account. Existing works focus on changing velocity‐based pseudonyms changing strategy and short changes interval with limited coverage, but due to similar velocity and short changes, internal attacker guesses easily known communication and location information due to location information of vehicle on tracking, which may expose adversary private information, and frequently, pseudonyms changing occurs due to movement of vehicles' similar velocity and short coverage, which may cause serious attack of vehicle. To overcome this problem, distance and cluster can be performed. In this work, we proposed distance and cluster‐based energy pseudonyms changing method for road network. We proposed distance and energy‐based clustering routing service over road network, the cluster head elected to depend on random number of distance and energy to change pseudonyms of vehicles. An each interval to be establish cluster head vehicle deployed while selects the operation mode and informs the cluster members of the selected mode through beacon signal. The cluster head vehicle node performs the pseudonyms changing based on the predicted distance and energy of the cluster member to use clustering optimization. The data of whole network send to report server through these nodes while near the RSU, and the vehicles in this area will use less energy to change the pseudonyms. The simulation results show that the proposed method enhances pseudonyms changing strategy less consumption and delays sufficient privacy level each vehicle also our method has outperform compare with existing methods than we use Sumo simulation and Matlab tools to verify our proposed method. Our proposed method outperformed in terms of pseudonym changing energy efficiency to careful attention during the cluster formation process, stable and balanced clusters that prolong the network lifetime, increases distances to more CH vehicles connectivity to makes clustering group and changing their pseudonyms in terms of high level privacy and finally, CH nodes use Dijkstra's algorithm use MST among the vehicles nodes depend on existing road networks to follow shortest path selection roads in terms of high connectivity probability of CH and stable structure of the network decreases the topology changes and thus,the clustering overhead is reduced.
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.