Cryptology ePrint Archive: Report 2022/133

Faster verification of V2X BSM messages via Message Chaining

Eduardo Lopes Cominetti and Marcos Vinicius M. Silva and Marcos A. Simplicio Jr. and Harsh Kupwade Patil and Jefferson E. Ricardini

Abstract: Vehicular-to-Everything (V2X) communications enable vehicles to exchange messages with other entities, including nearby vehicles and pedestrians. V2X is, thus, essential for establishing an Intelligent Transportation System (ITS), where vehicles use information from their surroundings to reduce traffic congestion and improve safety. To avoid abuse, V2X messages should be digitally signed using valid digital certificates. Messages sent by unauthorized entities can then be discarded, while misbehavior can lead to the revocation of the corresponding certificates. One challenge in this scenario is that messages must be verified shortly after arrival (e.g., within centiseconds), whereas vehicles may receive thousands of them per second. To handle this issue, some solutions propose prioritization or delayed-verification mechanisms, while others involve signature schemes that support batch verification. In this manuscript, we discuss two mechanisms that complement such proposals, enabling the authentication of a sequence of messages from the same source with one single signature verification. Our analysis shows that the technique can reduce the number of verified signatures by around 90% for reliable communication channels, and by more than 65% for a maximum packet loss rate of 20%.

Category / Keywords: applications / Vehicular communications (V2X), security

Date: received 6 Feb 2022

Contact author: ecominetti at larc usp br

Available format(s): PDF | BibTeX Citation

Version: 20220209:085711 (All versions of this report)

Short URL: ia.cr/2022/133


[ Cryptology ePrint archive ]