Time-Based CAN Intrusion Detection Benchmark
Deborah H. Blevins (1), Pablo Moriano (2), Robert A. Bridges (2), Miki, E. Verma (2), Michael D. Iannacone (2), Samuel C Hollifield (2) ((1), University of Kentucky, (2) Oak Ridge National Laboratory)

TL;DR
This paper benchmarks four time-based CAN intrusion detection systems using the ROAD dataset with real attacks, revealing that distribution-agnostic methods outperform distribution-based ones by at least 55% in AUC-PR, and introduces a lightweight hardware detector.
Contribution
It provides a comprehensive benchmark of existing time-based CAN IDSs on real attack data and introduces a practical hardware implementation for deployment.
Findings
Distribution-agnostic methods outperform distribution-based methods by at least 55% in AUC-PR.
The ROAD dataset enables realistic evaluation of CAN IDSs with real stealthy attacks.
A lightweight hardware detector can deploy the best IDS in nearly any vehicle.
Abstract
Modern vehicles are complex cyber-physical systems made of hundreds of electronic control units (ECUs) that communicate over controller area networks (CANs). This inherited complexity has expanded the CAN attack surface which is vulnerable to message injection attacks. These injections change the overall timing characteristics of messages on the bus, and thus, to detect these malicious messages, time-based intrusion detection systems (IDSs) have been proposed. However, time-based IDSs are usually trained and tested on low-fidelity datasets with unrealistic, labeled attacks. This makes difficult the task of evaluating, comparing, and validating IDSs. Here we detail and benchmark four time-based IDSs against the newly published ROAD dataset, the first open CAN IDS dataset with real (non-simulated) stealthy attacks with physically verified effects. We found that methods that perform…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
