Cited by 14Network Security and Intrusion DetectionNetwork Packet Processing and OptimizationAdversarial Robustness in Machine Learning

Decision Tree-Based Rule Derivation for Intrusion Detection in Safety-Critical Automotive Systems

Buschlinger, Lucas, Rieke, Roland, Sarda, Sanat, Kraus, Christoph·2022·2022 30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)

Abstract

Intrusion Detection Systems (IDSs) are being introduced into safety-critical systems such as connected vehicles. Since the behavior and effectiveness of measures are validated before approval, the decisions made by an IDS are required to be traceable and the IDS also needs to work efficiently on resource-constrained embedded systems. These requirements complicate the direct use of Machine Learning (ML) approaches in IDS design. In this paper, we propose an approach to using ML to generate rules for an efficient rule-based IDS like Snort. Our approach eases the time-consuming and difficult process of creating a rule set. We use decision trees to generate rules that can be used by experts as a basis for creating a rule set for a specific safety-critical use case. In addition, we use long short-term memory methods to circumvent the problem of limited training data availability, a common limitation in safety-critical systems. Our implementation and evaluation shows the feasibility of our approach to derive specific IDS rules for such systems.

Integrity signals

Registry

Crossref · 10.1109/pdp55904.2022.00046

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Authors
Buschlinger, L., Rieke, R., Sarda, S., & Kraus, C.
Affiliations
  • Fraunhofer Institute for Secure Information Technology (DE)
  • Fraunhofer Singapore (SG)
  • Darmstadt University of Applied Sciences (DE)
Venue
2022 30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)
Publisher
IEEE
Published
2022-03
Pages
246-254
ISSN
1066-6192 (ISSN-L)
OpenAlex
W4224287509
Cited by
14
References
28
Citations by year
2026: 2 · 2025: 2 · 2024: 4 · 2023: 6
FWCI
2.91
Type
conference paper
Language
en
Open access
closed
Locations
  • Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) (publishedVersion)
  • Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
Funders
Ministry of Education
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
  • Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
intrusion detection systems, decision tree, rule generation, connected vehicles, Snort, long short-term memory, limited training data, traceability, embedded systems

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review