Mutual Authentication Protocol for Secure Vehicular Platoon Admission

Vehicular platooning offers several advantages and plays an important role in the future of mobility. However, this technology is vulnerable to several attacks. Since vehicles can freely join and leave a platoon, it is important to ensure that only legitimate vehicles are admitted into a platoon. In this paper, we propose a mutual authentication protocol to securely admit vehicles into a platoon. The proposed protocol is built on the concepts of Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs). Each vehicle creates its DID which helps to achieve vehicle identity privacy. The vehicles must register with a Trusted Authority (TA) to join platoons. The TA issues a VC to the registered vehicle. The platoon leader and the vehicle joining the platoon verify each other’s VC before the vehicle joins the platoon. The security analysis demonstrates that the proposed protocol ensures secure platoon admission and preserves the privacy of vehicles. We also provide a proof of concept implementation of the blockchain network for the proposed scheme using Ethereum. We use the online Integrated Development Environment (IDE) Remix to compile and run the smart contract written in Solidity code for the proof of concept implementation. A performance analysis of the proposed protocol shows that its computation cost is less than that of other existing schemes for platoon admission.

Authors

Institutions

Publication Details

Published
2024-10-07
DOI
https://doi.org/10.1109/vtc2024-fall63153.2024.10757956
Citations
2
Primary Topic
Vehicular Ad Hoc Networks (VANETs)
Type
article
Field-Weighted Citation Impact
0.42

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mutual Authentication Protocol for Secure Vehicular Platoon Admission

Biplab Sikdar, Rohini Poolat Parameswarath
2 citations
Vehicular Ad Hoc Networks (VANETs)
0.42
article

Mutual Authentication Protocol for Secure Vehicular Platoon Admission

Biplab Sikdar, Rohini Poolat Parameswarath
article en
2 citations

Abstract

Vehicular platooning offers several advantages and plays an important role in the future of mobility. However, this technology is vulnerable to several attacks. Since vehicles can freely join and leave a platoon, it is important to ensure that only legitimate vehicles are admitted into a platoon. In this paper, we propose a mutual authentication protocol to securely admit vehicles into a platoon. The proposed protocol is built on the concepts of Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs). Each vehicle creates its DID which helps to achieve vehicle identity privacy. The vehicles must register with a Trusted Authority (TA) to join platoons. The TA issues a VC to the registered vehicle. The platoon leader and the vehicle joining the platoon verify each other’s VC before the vehicle joins the platoon. The security analysis demonstrates that the proposed protocol ensures secure platoon admission and preserves the privacy of vehicles. We also provide a proof of concept implementation of the blockchain network for the proposed scheme using Ethereum. We use the online Integrated Development Environment (IDE) Remix to compile and run the smart contract written in Solidity code for the proof of concept implementation. A performance analysis of the proposed protocol shows that its computation cost is less than that of other existing schemes for platoon admission.

National University of Singapore (SG)
National Research Foundation
Openalex Percentile: Top 35%
Vehicular Ad Hoc Networks (VANETs)
0.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.