Exploiting Partial Order of Keys to Verify Security of a Vehicular Group Protocol

Vehicular networks will enable a range of novel applications to enhance road traffic efficiency, safety, and reduce fuel consumption. As for other cyber-physical systems, security is essential to the deployment of these applications and standardisation efforts are ongoing. In this paper, we perform...

Full description

Saved in:
Bibliographic Details
Published in2022 IEEE 35TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2022) pp. 305 - 318
Main Authors Boeira, Felipe, Asplund, Mikael
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2022
SeriesProceedings IEEE Computer Security Foundations Symposium
Subjects
Complexity theory
Cyber-physical systems
formal verification
Fuels
proof strategy
protocol security
Protocols
Roads
Safety
Systematics
vehicular platooning
Online AccessGet full text

Cover

More Information
Summary:Vehicular networks will enable a range of novel applications to enhance road traffic efficiency, safety, and reduce fuel consumption. As for other cyber-physical systems, security is essential to the deployment of these applications and standardisation efforts are ongoing. In this paper, we perform a systematic security evaluation of a vehicular platooning protocol through a thorough analysis of the protocol and security standards. We tackle the complexity of the resulting model with a proof strategy based on a relation on keys. The key relation forms a partial order, which encapsulates both secrecy and authenticity dependencies. We show that our order-aware approach makes the verification feasible and proves authenticity properties along with secrecy of all keys used throughout the protocol.
ISBN:9781665484176
9781665484183
1665484187
1665484179
DOI:10.1109/CSF54842.2022.9919664