taesiri commited on
Commit
e967970
1 Parent(s): c77b889

Upload papers/2312/2312.13737.tex with huggingface_hub

Browse files
Files changed (1) hide show
  1. papers/2312/2312.13737.tex +963 -0
papers/2312/2312.13737.tex ADDED
@@ -0,0 +1,963 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \documentclass[conference]{IEEEtran}
2
+ \IEEEoverridecommandlockouts
3
+ \usepackage{cite}
4
+ \usepackage{amsmath,amssymb,amsfonts}
5
+ \usepackage{algorithmic}
6
+ \usepackage{graphicx}
7
+ \usepackage{textcomp}
8
+ \usepackage{xcolor}
9
+ \usepackage[nolist]{acronym}
10
+ \usepackage{paralist}
11
+ \usepackage{listings}
12
+ \usepackage{svg}
13
+ \usepackage{changepage}
14
+ \usepackage{enumerate}
15
+ \def\BibTeX{{\rm B\kern-.05em{\sc i\kern-.025em b}\kern-.08em
16
+ T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}}
17
+
18
+ \newcommand{\todo}[1]{\textbf{\color{red}{TODO: #1}}}
19
+ \newcommand{\fix}[1]{\textbf{\color{orange}{FIX: #1}}}
20
+ \newcommand{\cmd}[1]{\textbf{\color{blue}{COMMENT: #1}}}
21
+ \newcommand{\mh}[1]{{\color{blue}{MH: #1}}}
22
+
23
+ \makeatletter
24
+ \newcommand{\myitem}[1]{\item[#1]\protected@edef\@currentlabel{#1}}
25
+ \makeatother
26
+
27
+ \begin{document}
28
+
29
+
30
+ \makeatletter
31
+ \def\ps@IEEEtitlepagestyle{\def\@oddfoot{\parbox{\textwidth}{\footnotesize
32
+ Author's version of a paper accepted for publication in Proceedings of 2023 IEEE Belgrade PowerTech.
33
+ \\
34
+ \textcopyright{} 2023 IEEE.
35
+ Personal use of this material is permitted.
36
+ Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.\vspace{1.2em}}
37
+ }}
38
+ \makeatother
39
+
40
+ \begin{acronym}
41
+ \acro{sg}[SG]{smart grid}
42
+ \acroplural{sg}[SGs]{smart grids}
43
+ \acro{der}[DER]{distributed energy resource}
44
+ \acroplural{der}[DERs]{distributed energy resources}
45
+ \acro{ict}[ICT]{information and communication technology}
46
+ \acro{fdi}[FDI]{false data injection}
47
+ \acro{scada}[SCADA]{Supervisory Control and Data Acquisition}
48
+ \acro{mtu}[MTU]{Master Terminal Unit}
49
+ \acroplural{mtu}[MTUs]{Master Terminal Units}
50
+ \acro{hmi}[HMI]{Human Machine Interface}
51
+ \acro{plc}[PLC]{Programmable Logic Controller}
52
+ \acroplural{plc}[PLCs]{Programmable Logic Controllers}
53
+ \acro{ied}[IED]{Intelligent Electronic Device}
54
+ \acroplural{ied}[IEDs]{Intelligent Electronic Devices}
55
+ \acro{rtu}[RTU]{Remote Terminal Unit}
56
+ \acroplural{rtu}[RTUs]{Remote Terminal Units}
57
+ \acro{iec104}[IEC-104]{IEC 60870-5-104}
58
+ \acro{apdu}[APDU]{Application Protocol Data Unit}
59
+ \acro{apci}[APCI]{Application Protocol Control Information}
60
+ \acro{asdu}[ASDU]{Application Service Data Unit}
61
+ \acro{io}[IO]{information object}
62
+ \acroplural{io}[IOs]{information objects}
63
+ \acro{cot}[COT]{cause of transmission}
64
+ \acro{mitm}[MITM]{Man-in-the-Middle}
65
+ \acro{fdi}[FDI]{False Data Injection}
66
+ \acro{ids}[IDS]{intrusion detection system}
67
+ \acroplural{ids}[IDSs]{intrusion detection systems}
68
+ \acro{siem}[SIEM]{Security Information and Event Management}
69
+ \acro{mv}[MV]{medium voltage}
70
+ \acro{lv}[LV]{low voltage}
71
+ \acro{cdss}[CDSS]{controllable distribution secondary substation}
72
+ \acro{bss}[BSS]{battery storage system}
73
+ \acroplural{bss}[BSSs]{battery storage systems}
74
+ \acro{pv}[PV]{photovoltaic inverter}
75
+ \acro{mp}[MP]{measuring point}
76
+ \acroplural{mp}[MPs]{measuring points}
77
+ \acro{dsc}[DSC]{Dummy SCADA Client}
78
+ \acro{fcli}[FCLI]{Fronius CL inverter}
79
+ \acro{fipi}[FIPI]{Fronius IG+ inverter}
80
+ \acro{sii}[SII]{Sunny Island inverter}
81
+ \acro{tls}[TLS]{Transport Layer Security}
82
+ \acro{actcon}[ActCon]{Activation Confirmation}
83
+ \acro{actterm}[ActTerm]{Activation Termination}
84
+ \acro{rtt}[RTT]{Round Trip Time}
85
+ \acro{c2}[C2]{Command and Control}
86
+ \acro{dst}[DST]{Dempster Shafer Theory}
87
+ \acro{ec}[EC]{Event Correlator}
88
+ \acro{sc}[SC]{Strategy Correlator}
89
+ \acro{ioc}[IoC]{Indicator of Compromise}
90
+ \acroplural{ioc}[IoCs]{Indicators of Compromise}
91
+ \acro{ot}[OT]{Operational Technology}
92
+ \acro{soc}[SOC]{Security Operation Center}
93
+ \acro{pcap}[PCAP]{Packet Capture}
94
+ \acro{wcgan}[WCGAN]{Wasserstein Generative Adversarial Network}
95
+ \acro{dae}[DAE]{Deep Auto Encoder}
96
+ \acro{lstm}[LSTM]{Long Short-Term Memory}
97
+ \acro{mlp}[MLP]{MultiLayer Perceptron}
98
+ \acro{ics}[ICS]{Industrial Control System}
99
+ \acroplural{ics}[ICSs]{Industrial Control Systems}
100
+ \acro{pera}[PERA]{Purdue Enterprise Reference Architecture}
101
+ \acro{ews}[EWS]{Engineering Workstation}
102
+ \acroplural{ews}[EWSs]{Engineering Workstations}
103
+ \acro{hmi}[HMI]{Human-Machine Interface}
104
+ \acroplural{hmi}[HMIs]{Human-Machine Interfaces}
105
+ \acro{fp}[FP]{False Positive}
106
+ \acroplural{fp}[FPs]{False Positives}
107
+ \acro{fn}[FN]{False Negative}
108
+ \acroplural{fn}[FNs]{False Negatives}
109
+ \acro{tp}[TP]{True Positive}
110
+ \acroplural{tp}[TPs]{True Positives}
111
+ \acro{tn}[TN]{True Negative}
112
+ \acroplural{tn}[TNs]{True Negatives}
113
+ \acro{rdf}[RDF]{Resource Description Framework}
114
+ \acro{shacl}[SHACL]{Shapes Constraint Language}
115
+ \acro{pcap}[PCAP]{Packet Capture}
116
+ \acroplural{pcap}[PCAPs]{Packet Captures}
117
+ \acro{nist}[NIST]{National Institute of Standards and Technology}
118
+ \acro{ml}[ML]{Machine Learning}
119
+ \end{acronym}
120
+ \bstctlcite{IEEEexample:BSTcontrol}
121
+
122
+ \title{An Approach to Abstract Multi-stage Cyberattack Data Generation for ML-Based IDS in Smart Grids}
123
+
124
+ \author{
125
+ \IEEEauthorblockN{Ömer Sen\IEEEauthorrefmark{1},
126
+ Philipp Malskorn\IEEEauthorrefmark{1},
127
+ Simon Glomb\IEEEauthorrefmark{1},
128
+ Immanuel Hacker\IEEEauthorrefmark{1},
129
+ Martin Henze\IEEEauthorrefmark{2}\IEEEauthorrefmark{3},
130
+ Andreas Ulbig\IEEEauthorrefmark{1}
131
+ }
132
+
133
+ \IEEEauthorblockA{\IEEEauthorrefmark{1}\textit{IAEW, RWTH Aachen Univserity,} Aachen, Germany\\
134
+ Email: \{o.sen, i.hacker, a.ulbig\}@iaew.rwth-aachen.de, \{philipp.malskorn, simon.glomb\}@rwth-aachen.de}
135
+ \IEEEauthorblockA{\IEEEauthorrefmark{2}\textit{Security and Privacy in Industrial Cooperation, RWTH Aachen University,} Aachen, Germany\\
136
+ \IEEEauthorrefmark{3}\textit{Cyber Analysis \& Defense, Fraunhofer FKIE,} Wachtberg, Germany\\
137
+ Email: henze@cs.rwth-aachen.de}
138
+ }
139
+
140
+ \maketitle
141
+
142
+
143
+
144
+ \begin{abstract}
145
+ Power grids are becoming more digitized, resulting in new opportunities for the grid operation but also new challenges, such as new threats from the cyber-domain.
146
+ To address these challenges, cybersecurity solutions are being considered in the form of preventive, detective, and reactive measures.
147
+ Machine learning-based intrusion detection systems are used as part of detection efforts to detect and defend against cyberattacks.
148
+ However, training and testing data for these systems are often not available or suitable for use in machine learning models for detecting multi-stage cyberattacks in smart grids.
149
+ In this paper, we propose a method to generate synthetic data using a graph-based approach for training machine learning models in smart grids.
150
+ We use an abstract form of multi-stage cyberattacks defined via graph formulations and simulate the propagation behavior of attacks in the network.
151
+ Within the selected scenarios, we observed promising results, but a larger number of scenarios need to be studied to draw a more informed conclusion about the suitability of synthesized data.
152
+ \end{abstract}
153
+
154
+ \begin{IEEEkeywords}
155
+ Intrusion Detection, Smart Grid, Cyberattacks, Machine Learning, Knowledge Graphs
156
+ \end{IEEEkeywords}
157
+
158
+ \section{Introduction} \label{sec:introduction}
159
+ The cyber-physical characteristic of the power grid, in particular the increasing penetration of \ac{ict}, addresses the issues of the distribution grid with respect to structural changes resulting from the integration of \ac{der}~\cite{vale2010distributed}.
160
+ In particular, it enables active grid operation at the distribution grid level and provides the backbone for the realization of \ac{sg} concepts~\cite{hossain2013smart,vandervelde2020methods}.
161
+ This circumstance provides not only new opportunities, but also new threats resulting from the increasing interconnectedness of systems and actors~\cite{yan2012survey}.
162
+ The new threat landscape consists not only of threats arising from cyber domain interdependencies, but also of new attack surfaces for cyberattacks that threaten the stability and reliability of the grid~\cite{mathas2020threat}.
163
+ To adequately address these new threats, defense and countermeasures must be integrated as an essential part of the \ac{sg} infrastructure, encompassing a holistic approach of preventive, detective, and reactive measures~\cite{kawoosa2021review}.
164
+ One challenge in integrating countermeasures in the form of active security concepts into power grids is the consideration of legacy compliance, especially for countermeasures that actively interfere with grid operations~\cite{sridhar2011cyber}.
165
+ More passive countermeasures such as \ac{ids} offer the opportunity to support cybersecurity observability without imposing restrictive requirements on existing infrastructures, such as the performance specification of endpoint hosts~\cite{krause2021cybersecurity}.
166
+ More autonomous \ac{ids} build on \ac{ml} that uses training data from operational or attack scenarios to classify anomalies or false positives from other \ac{ids} to support \ac{soc}~\cite{demertzis2018next}.
167
+ However, this requires attack data for the development and validation of these measures, especially data-driven approaches, which often cannot be accessed for security or privacy reasons~\cite{burstein2008toward}.
168
+ To address these challenges, attack data are generated synthetically~\cite{zarpelao2020machine} or under laboratory conditions~\cite{ashok2016powercyber}.
169
+ Laboratory environments can provide accurate data, but are costly to set up and consequently inflexible and difficult to scale.
170
+ Synthetically generated data are more flexible and transferable to other use cases due to their level of abstraction, but can also suffer in quality due to inaccurate modeling and simulation.
171
+
172
+ To provide a basis for studying the cybersecurity of the \ac{sg} by enabling the generation of attack data, a viable approach that compromises accuracy and effort is required.
173
+ More specifically, the challenges we address in this paper are:
174
+ \begin{enumerate}[(i)]
175
+ \item Replication of the \ac{sg} with all layers relevant for attack data synthesis and considering multi-stage patterns.
176
+ \item Execution of multi-stage attacks that replicate consistent and flexible attack patterns for dataset diversity.
177
+ \item Generation of adequate data sets using processable formats and consistent data structures based on use cases.
178
+ \end{enumerate}
179
+
180
+ Therefore, in this paper, we propose a multi-stage approach to synthesize cyberattack data that allows generating datasets for \ac{ml} based \ac{ids} in an abstract manner.
181
+ To this end, we present an approach based on a knowledge graph that abstracts the network and multi-stage attack procedures in \ac{sg} application scenarios.
182
+ In particular, our contributions are:
183
+ \begin{enumerate}
184
+ \item We present the state of the art in synthesizing multistage cyberattack data and highlight the challenges of attack data generation (Section~\ref{sec:analysis}).
185
+ \item We describe the overall approach consisting of modeling, knowledge graph representation, and simulation of multi-stage cyberattacks in \ac{sg} (Section~\ref{sec:framework}).
186
+ \item We demonstrate and discuss the dataset generation capabilities and quality of our proposed approach through case studies and comparisons with real datasets (Section~\ref{sec:result}).
187
+ \end{enumerate}
188
+ \section{Background} \label{sec:background}
189
+ In this section, we describe the structure of \acp{sg} (Section~\ref{subsec:background_sg}), anomaly detection (Section~\ref{subsec:background_ad}), multi-stage cyberattacks (Section~\ref{subsec:background_ca}) and attack data synthesis (Section~\ref{subsec:background_adg}).
190
+
191
+ \subsection{Smart Grid} \label{subsec:background_sg}
192
+ Based on \ac{pera} for \ac{ics}, \acp{sg} are composed of five main levels: field devices, control systems, and management/operation as well as corporate systems~\cite{assante2015industrial, hossain2012smart, Zscaler.2022}. Field devices, Level 0, make up the physical infrastructure of the \ac{sg} and are responsible for monitoring and controlling various aspects of the \ac{sg}.
193
+ Control systems, Level 1, process and analyze the data collected from the field devices to make decisions and perform control actions.
194
+ Management systems, Level 2, provide higher-level oversight and coordination of the \ac{sg} and provide a connection to external networks and systems.
195
+ The third level, Level 3, handles the management of production processes, such as managing batches, utilizing manufacturing operations management systems and manufacturing execution systems, and maintaining records of data.
196
+ Level 4 encompasses systems like enterprise resource planning software, databases, email servers, and other tools that are used for logistics and communication, as well as for data storage.
197
+ Lastly, the fifth level, Level 5, is the enterprise network, which is not part of the \ac{ics} but is used to gather data from the \ac{ics} systems to make business decisions.
198
+
199
+ \subsection{Anomaly Detection} \label{subsec:background_ad}
200
+ \acp{sg}, which are a type of \ac{ics}, are vulnerable to cyberattacks.
201
+ Therefore, it is important to develop methods for detecting anomalies in network traffic that may indicate the presence of a cyberattack~\cite{baptiste2021systematic}.
202
+ One approach to anomaly detection in \acp{sg} is to analyze network traffic patterns~\cite{perales2020madics}.
203
+ By analyzing sensor readings, control signals, communication logs, and network traffic it is possible to identify deviations from normal behavior that may indicate the presence of a cyberattack~\cite{wolsing2022ipal}.
204
+ Another aspect to consider in anomaly detection for \acp{sg} is the possibility of multi-stage cyberattacks~\cite{sen2022onusing}.
205
+ These types of attacks involve multiple steps, each of which may be difficult to detect individually.
206
+ Therefore, it is important to consider not only individual anomalies, but also the potential for multiple attacks to be connected in a coordinated fashion.
207
+ Overall, anomaly detection in \acp{sg} requires a combination of techniques that can analyze network traffic patterns and identify deviations from normal behavior.
208
+ By using \ac{ml} algorithms and other advanced techniques, it is possible to detect anomalies that may indicate the presence of a multi-stage cyberattack and take appropriate action to prevent damage to the system~\cite{kus2022afalse}.
209
+
210
+ \subsection{Multi-Stage Cyberattack} \label{subsec:background_ca}
211
+ Multi-stage cyberattacks on \acp{sg} can be difficult to detect and mitigate due to their complexity and the ability for attackers to adapt and evolve their tactics~\cite{ju2020mckc}.
212
+ To better understand and combat these types of attacks, researchers have developed various methods for structuring and analyzing multi-stage cyberattacks in a systematic and structured way.
213
+ One common approach is the use of kill-chain like concepts, which divide the attack process into distinct stages such as reconnaissance, weaponization, delivery, and exploitation~\cite{yadav2015technical}.
214
+ Another approach is the use of open-source datasets, such as the MITRE ATT\&CK Matrix, which catalogs observed cyberattack incidents and can be used to identify patterns and trends in the attack process~\cite{alexander2020mitre, TheMITRECorporation.1182022}.
215
+ The MITRE ATT\&CK Matrix for \acp{ics} is a comprehensive tool used to catalog observed cyberattack incidents in the \ac{ics} environment.
216
+ It maps 96 types of attacks to 11 types of tactics and 67 new techniques specific to the \ac{ics} environment.
217
+ The matrix is useful resource for generating synthetic multi-stage cyberattack data for \ac{ml}-based anomaly detection and help security professionals understand and detect the various methods and tactics used by adversaries in attacks on \acp{ics}.
218
+
219
+ \subsection{Attack Data Generation} \label{subsec:background_adg}
220
+ The generation of an attack dataset for anomaly detection in \acp{ics} is a critical aspect of security research.
221
+ One of the major challenges in generating multi-stage cyberattack data for \ac{ml}-based anomaly detection is the reproducibility of the attack sequence~\cite{choi2019comparison}.
222
+ It is essential to design an attack sequence that is suitable for the purpose of the dataset and implement it through automation using an integrated representation.
223
+ This allows for the reproduction of the attack sequence and enables the explanation of the abnormal dataset information~\cite{choi2021probabilistic}.
224
+ Additionally, generating a diverse range of attack sequences with specific requirements can be difficult, so a model that can reflect more diverse attack sequences is needed.
225
+ One approach for generating an attack dataset is to analyze existing attack cases from the viewpoint of the MITRE ATT\&CK framework, which catalogs observed cyberattack incidents and maps them to specific tactics and techniques.
226
+ Another approach is to use an integrated representation, such as the hidden Markov model (HMM), to reproduce a sequence of attacks in a systematic and structured way.
227
+ This allows for the creation of diverse attack sequences that reflect the reality of observed attacks and meet specific requirements, such as reproducibility and diversity. \section{Related Work \& Problem Analysis} \label{sec:analysis}
228
+ In this section, we present related work (Section~\ref{subsec:analysis_network}) and give a problem statement for this work (Section~\ref{subsec:analysis_problem}).
229
+
230
+ \subsection{Related Work} \label{subsec:analysis_network}
231
+ One direction within this research field are approaches that generate attack data in the lab.
232
+ An example of this is the work of Sharafaldin et al.\ ~\cite{sharafaldin2018toward}.
233
+ A dataset called CICIDS2017 was generated via a lab experiment.
234
+ This contains recent attacks from DoS, DDoS, brute force, XSS, SQL injection, infiltration, port scan, and botnet.
235
+ Another interesting approach to generating new datasets is presented by Cordero et al.~\cite{cordero2021generating}.
236
+ Cordero et al.\ have developed the ID2T framework, which generates reproducible datasets for \ac{ml} based \ac{ids}.
237
+ Instead of generating more datasets, Pandey et al.\ ~\cite{pandey2021gan} attempt to modify existing datasets.
238
+ To test this method, the dataset UNSW-NB15 is considered.
239
+ This consists of normal traffic and a variety of attacks from nine categories.
240
+ With the \ac{dae} and the \ac{wcgan}, additional data are generated and added to the original dataset.
241
+ The main goal of this work is to investigate the detection quality of \ac{ids} trained on a synthetic dataset.
242
+ For this purpose, we select a suitable \ac{ml} based \ac{ids} method that exploits the structure and temporal dynamics of the dataset.
243
+ For instance, Gwon et al.\ ~\cite{gwon2019network} investigate whether \ac{lstm} networks are suitable for binary classification of network packets.
244
+ The \ac{lstm} network classifies each network packet as part of normal or as part of malicious traffic.
245
+ Oliveira et al.\ ~\cite{oliveira2021intelligent} investigate the performance of different \ac{ml} models for anomaly detection.
246
+ In this context, the performance of a Random Forest, a \ac{mlp}, and an \ac{lstm} network on the CIDDS-001 dataset are compared.
247
+ The results show that the \ac{lstm} network performs with an accuracy of 99.94\% and a F1 score of 0.91 provides the best results.
248
+
249
+ \subsection{Problem Analysis} \label{subsec:analysis_problem}
250
+ The process of creating datasets in a laboratory environment involves planning and implementing the infrastructure and scenarios, monitoring the system during execution, recording data, and ensuring proper execution.
251
+ This process is highly labor-intensive and requires expertise in various subfields of computer science such as networks and cybersecurity.
252
+ However, these datasets are not modifiable, making it difficult to add or remove attacks or change network topologies without re-running the experiment.
253
+ Additionally, attack data is often underrepresented in these datasets as normal network traffic usually dominates.
254
+ Care must be taken to prevent attacks on the network while data is being recorded to avoid compromising the dataset.
255
+ This becomes more difficult to ensure depending on the size and complexity of the observed network.
256
+ In addition, a separate network must be set up in the laboratory to record normal traffic, or a procedure must be implemented to obscure identifying information in the data for privacy reasons.
257
+ There is also the problem of limited diversity in using public datasets to create additional datasets due to their limited availability.
258
+ Researchers in \ac{ml} also face the challenge of evaluating the performance of their models using only one dataset, leading to models that may not perform well in real network environments.
259
+ This is further compounded by the lack of suitable datasets for training \ac{ml} models.
260
+ \section{Abstract Multi-Staged Attack Data Synthesis} \label{sec:framework}
261
+ To overcome the problems mentioned in Section~\ref{subsec:analysis_problem}, this paper presents an approach that abstracts multi staged attack data and generates it synthetically.
262
+ To achieve this goal, an abstracted data format based on real data must first be devised.
263
+ In the second step, a framework for synthetic generation of this data must be developed.
264
+ For this work, different forms of data representation for the attack data are examined.
265
+ Among them are network packets, network flows and \ac{ids} alert logs.
266
+ The decision which of these data representations are most suited for the abstracted data synthesis is based on the following criteria:
267
+ \begin{enumerate}
268
+ \myitem{(D1)} Representation of data that is accessible in \ac{ics} and enterprise networks. \label{data_requirements_1}
269
+ \myitem{(D2)} Representation of data that is collected in a standardized format. \label{data_requirements_2}
270
+ \myitem{(D3)} Representation of data that is accessible in a human-readable and understandable form. \label{data_requirements_3}
271
+ \end{enumerate}
272
+ The investigation of the different forms of representation of the attack data has shown that \ac{ids}-alert logs are suitable for abstraction and synthesis as they fulfill all requirements.
273
+ For Requirement~\ref{data_requirements_1}, the survey \textit{A SANS 2021 Survey: \ac{ot}/\ac{ics} Cybersecurity} shows that 62\% of grid operators use signature-based \ac{ids} ~\cite{MarkBristow.2021}.
274
+ Requirement~\ref{data_requirements_2} is satisfied as there are standardized file formats for \ac{ids}-alert such as the unified2 format used by the Snort \ac{ids} ~\cite{SnortProject.2020}.
275
+ The last Requirement~\ref{data_requirements_3} is met because \ac{ids}-alerts are designed to provide information to grid operators such that they can initiate countermeasures.
276
+
277
+ \subsection{Requirement Analysis} \label{subsec:requirements_analysis}
278
+ In this section, requirements for the data synthesis framework are identified.
279
+ The requirements can be divided into functional and non-functional requirements.
280
+ Functional requirements describe the desired functionalities of the system while non-functional requirements describe the boundary conditions and quality in which those functionalities must be provided.
281
+ The non-functional requirements include:
282
+ \begin{enumerate}
283
+ \myitem{(N1)} The framework must not use any additional hardware or virtualization. \label{non_functional_1}
284
+ \myitem{(N2)} The framework must not use additional applications for data generation. \label{non_functional_2}
285
+ \myitem{(N3)} The framework must not use attack signatures from existing \ac{ids}. \label{non_functional_3}
286
+ \myitem{(N4)} The framework must not require existing attack datasets. \label{non_functional_4}
287
+ \end{enumerate}
288
+ Requirements~\ref{non_functional_1} and~\ref{non_functional_2} ensure that the effort for the configuration and setup does not exceed the effort of lab attempts.
289
+ This is necessary because data from laboratory tests are closer to reality and should therefore be preferred if the production effort is the same.
290
+ Requirements~\ref{non_functional_3} and~\ref{non_functional_4} ensure that poor data quality of existing datasets or poor documentation of existing \ac{ids} signatures do not affect this work.
291
+ The following functional requirements set request to the synthesis framework and the abstract data:
292
+ \begin{enumerate}[(i)]
293
+ \myitem{(F1)} Attack data must be generated in the form of identified data representation, i.e.\ as \ac{ids} log files.
294
+ \myitem{(F2)} Attack data must contain \acp{fp}.
295
+ \myitem{(F3)} Attack data must contain \acp{fn}.
296
+ \myitem{(F4)} Networks must be flexible and scalable, i.e.\ must be freely configurable.
297
+ \myitem{(F5)} Networks must be representative, i.e.\ contain Enterprise and \ac{ics} Devices.
298
+ \myitem{(F6)} Attacks must be diverse, i.e.\ be freely configurable.
299
+ \myitem{(F7)} Attacks must be multi-staged.
300
+ \end{enumerate}
301
+ The framework should generate data in the form of abstracted \ac{ids} alert logs, taking into account the different probabilities of \acp{fn} and \acp{fp} in real-world scenarios.
302
+ Users should have the capability to configure networks and attacks for defining flexible and scalable scenarios.
303
+ To provide a representative depiction of \ac{sg}, the networks should include devices from both enterprise and \ac{ics} layers.
304
+ The framework should be able to simulate both \acp{fn} and \acp{fp} cases based on \ac{ids}-detection accuracy and placement in network.
305
+ Multi-stage attacks are more complex and have multiple phases or stages, rather than being a single action.
306
+ To simulate different scenarios, the configurable attacks should be able to represent and simulate complex and diverse attack strategies and actions.
307
+ This way, the framework will be able to provide a realistic representation of how \ac{ids} behaves.
308
+
309
+ \subsection{Data Abstraction} \label{subsec:data_abstraction}
310
+ In this section, the data format selected for synthesis is reduced to a simplified representation.
311
+ In the following, the individual data fields of Snort's unified2 format are used as a basis because it is efficient and can store large amounts of data.
312
+ MITRE ATT\&CK matrix is used to abstract the cyberattack data and focus on essential information for cyberattack analysis, such as tactics and techniques used by attackers.
313
+ This form of abstraction provides an efficient way to store and analyze large amounts of \ac{ids} data and allows for rapid identification of patterns and trends in the data.
314
+ Table~\ref{tab:abstracted_alerts} gives an overview of the data fields of the abstracted data format.
315
+ \begin{table}[]
316
+ \center
317
+ \caption{Data fields of the abstracted ids alerts.}
318
+ \begin{tabular}{ll}
319
+ \multicolumn{1}{l|}{\textbf{Field}} & \textbf{Description} \\ \hline
320
+ \multicolumn{1}{l|}{Source-IP} & IP address of the attacker. \\
321
+ \multicolumn{1}{l|}{Target-IP} & IP address of the target. \\
322
+ \multicolumn{1}{l|}{Source-Platform} & MITRE platform of the attacker. \\
323
+ \multicolumn{1}{l|}{Target-Platform} & MITRE platform of the target. \\
324
+ \multicolumn{1}{l|}{MITRE-Tactic} & Detected MITRE tactic. \\
325
+ \multicolumn{1}{l|}{MITRE-Technique} & Detected MITRE technique. \\
326
+ \multicolumn{1}{l|}{Sensor-IP} & IP address of the detecting sensor. \\
327
+ \multicolumn{1}{l|}{\ac{fp}-Flag} & A flag that indicates if the alert is \ac{fp}. \\
328
+ \multicolumn{1}{l|}{Attack-Label} & The attack label indicates which multilevel \\
329
+ \multicolumn{1}{l|}{}& attack generated the alert. \\
330
+ \end{tabular}
331
+ \label{tab:abstracted_alerts}
332
+ \end{table}
333
+
334
+
335
+ \subsection{Framework Overview} \label{subsec:framework_overview}
336
+ The framework architecture is designed to provide an overview of the system for data synthesis.
337
+ It is implemented in Python, which is a suitable programming language for prototyping due to its debugging capability and high abstraction.
338
+ The system architecture is divided into different modules, as shown in Figure~\ref{fig:system_overview}.
339
+ It illustrates the inputs, outputs and interactions of the different modules.
340
+ All inputs to the system are in \ac{rdf} data in Turtle format.
341
+ For handling \ac{rdf}, the Python library \textit{rdflib}~\cite{RDFLibTeam.rdf.2022} is used, which allows for reading, writing and querying \ac{rdf} files using SPARQL.
342
+ To use \ac{rdf} in combination with \ac{shacl}, another library called pyshacl~\cite{RDFLibTeam.pyshacl.2022} is used, which allows for testing \ac{rdf} data against previously defined constraints.
343
+ \begin{figure}[h]
344
+ \center
345
+ \includesvg[scale=0.55]{chapter3/system_overview.svg}
346
+ \caption{Overview of the developed data synthesis framework.}
347
+ \label{fig:system_overview}
348
+ \end{figure}
349
+ In the following the interaction of the individual modules is addressed.
350
+ First of all, the Network Manager reads a network configuration, which contains the description of a network.
351
+ Network-Manager then generates a network graph from this information and provides functions for path finding.
352
+ Next, the network graph is handed over to the attack coordinator.
353
+ This module reads the attack configuration, which defines a multi-staged attack.
354
+ Based on this configuration, a set of attack instances is determined by executing the attack on the network graph.
355
+ These attack instances, along with the network graph, are then passed to the simulator.
356
+ The simulator uses this information to generate \ac{ids} alerts for selected attack instances by checking if the attack communication is detected by an \ac{ids}.
357
+ In addition, \ac{fn} and \ac{fp} are generated.
358
+ The rate of \ac{fn} and \ac{fp} can be controlled.
359
+ Finally, the simulator bundles the generated alerts into a csv file.
360
+ Due to the efficient use of the integrated SPARQL query language in rdf, the generation is done in a reasonable time frame.
361
+
362
+ \subsection{Model Network} \label{subsec:model_network}
363
+ The network is modeled by a connected and undirected graph
364
+ $G_{net} = (V_{net}, E_{net})$.
365
+ In our model, an edge between two nodes $v_1, v_2 \in V_{net}$ exists if and only if there is a defined communication connection between them.
366
+ The set of nodes $V_{net}$ consists of four types of nodes, which can be used for constructing a network.
367
+ These can be found in Table~\ref{tab:node_types}.
368
+ \begin{table}[]
369
+ \center
370
+ \caption{Types of nodes in the network graph.}
371
+ \begin{tabular}{ll}
372
+ \multicolumn{1}{l|}{\textbf{Node Type}} & \textbf{Description} \\ \hline
373
+ \multicolumn{1}{l|}{Computer} & \parbox{0.3\textwidth}{Computers represent all devices in the network, which provide or use services for the control of the \ac{sg}.} \\
374
+ \multicolumn{1}{l|}{Router} & \parbox{0.3\textwidth}{Routers represent the edge router of the network.} \\
375
+ \multicolumn{1}{l|}{Switches} & \parbox{0.3\textwidth}{Switches connect the individual components of the network and are possible nodes for the implementation of \ac{ids}.} \\
376
+ \multicolumn{1}{l|}{Firewalls} & \parbox{0.3\textwidth}{Firewalls restrict the communication of the network and can be configured by rules.} \\
377
+ \end{tabular}
378
+ \label{tab:node_types}
379
+ \end{table}
380
+ Each node must contain at least an IP address and a MITRE platform.
381
+ The IP address must be unique, because in this framework it is used to identify nodes.
382
+ MITRE platforms are a set of platforms that are referenced as possible targets by MITRE Techniques.
383
+ These are later used to find possible targets for the configurable multi-stage attacks.
384
+ For both attributes sets can be defined.
385
+ The set \textit{IP-addresses} can be defined with a Range of ipv4 or ipv6 addresses and the set \textit{Platforms} is a subset of all MITRE Platforms, which can be selected based on the network being modeled.
386
+ For instance, it can include IP addresses in the range of ''172.32.0.0 - 172.47.255.255'', ''192.168.0.0 - 192.169.255.255'' or ''198.20.0.0 - 198.255.255.255''.
387
+ \begin{align}
388
+ \text{IP-addresses} =& \{\text{0.0.0.0, ..., 255.255.255.255}\}\\
389
+ \text{Platforms} =& \{\text{Network, Windows, Linux, ..., Containers,}\nonumber \\
390
+ & \text{Control Server, Data Historian, ...,}\}
391
+ \end{align}
392
+ The Set of all nodes $V_{net}$ consists of the union of all node sets $ V_{net} = \{\text{Computer}\} \cup \{\text{Router}\} \cup \{\text{Switches}\} \cup \{\text{Firewalls}\}$.
393
+ In the following the attributes of the individual node types are specified.
394
+ Computers and routers contain only ip and platform therefore this can be formally stated as:
395
+ \begin{align}
396
+ \text{Computer} =& \{ (p_i, ip_i) | p_i \in \text{Platform}, ip_i \in \text{IP-addresses} \} \\
397
+ \text{Router} =& \{ (p_j, ip_j) | p_j \in \text{Platform}, ip_j \in \text{IP-addresses} \}
398
+ \end{align}
399
+ Switches must also contain the information whether an \ac{ids} has been implemented.
400
+ A Network-based \ac{ids} collects data from a switch via network taps or mirrored ports (SPAN-Ports) configured on the switch to detect and alert on suspicious network activity.
401
+ For this an additional boolean variable \textit{IsNIDSActiv} must be added.
402
+ If the value is True, it is assumed that a \ac{ids} is active at this switch.
403
+ The set of Switches is formally stated as follows:
404
+ \begin{align}
405
+ \text{Switches} =& \{ (p_k, ip_k, \text{IsNIDSActiv}) | \nonumber \\
406
+ &p_k \in \text{Platform}, \nonumber \\
407
+ &ip_k \in \text{IP-addresses}, \nonumber \\
408
+ &\text{IsNIDSActiv} \in \{True, False\} \}
409
+ \end{align}
410
+ Finally, the set of firewalls and their rules must be defined.
411
+ The rules consist of a tuple with three items, which refers to a switch $s_1$, a switch $s_2$ and a computer $c_1$.
412
+ \begin{align}
413
+ \text{Firewalls} =& \{(p_l,ip_l,R)| \nonumber\\
414
+ &p_l \in \text{Platform},\nonumber\\
415
+ &ip_l \in \text{IP-addresses},\nonumber\\
416
+ &R \subseteq \text{Rules} \}\\
417
+ \text{Rules} =& \{(c_i, s_{k1}, s_{k2})| \nonumber \\
418
+ &c_i \in \text{Computer}, \nonumber \\
419
+ &s_{k1}, s_{k2} \in \text{Switches}\}
420
+ \end{align}
421
+ To understand how the rules work, the possible edges and the concept of communication for $G_{net}$ has to be defined first.
422
+ The edges $E_{net}$ of the network graph $G_{net}$ consists of a subset of the cross product of $V_{net}$ with \text{Switches}.
423
+ \begin{align}
424
+ E_{net} \subseteq \{(e_1, e_2) | e_1 \in V_{net}, e_2 \in \text{Switches}\}
425
+ \end{align}
426
+ This implies that each edge must be connected to at least one switch.
427
+ A device $v_1$ can start to communicate with another device $v_2$ if there exists a path from $v_1$ to $v_2$, where each firewall allows the device $v_1$ to communicate.
428
+ A possible paths can contain either no, one, or several firewalls.
429
+ In case there is no firewall on the path, device $v_1$ can communicate with device $v_2$.
430
+ In the two other cases, each firewall must contain a rule that allows communication.
431
+ The evaluation of the firewall rules works the same way in both cases.
432
+ Without loss of generality we can consider the following path:
433
+ \begin{align}
434
+ v_1 \rightarrow ... \rightarrow s_1 \rightarrow f_1 \rightarrow s_2 \rightarrow ... \rightarrow v_2
435
+ \end{align}
436
+ For $v_1$ to communicate with $v_2$, the firewall $f_1$ must contain the rule $(s_1,s_2,v_1)$.
437
+ Here $s_1$ references the switch that is on the path directly before the firewall, $s_2$ references the switch that is directly after the firewall and $v_1$ is the device which would like to start the communication.
438
+ Over the given switches each rule gets a direction, this is reflected in the fact that the communication in the graph $G_{net}$ is not symmetrical.
439
+ In this way, the communication in the network can be precisely controlled.\par
440
+ An example of a simple network graph can be seen in Figure~\ref{fig:netzwerk_graph}.
441
+ This contains seven nodes, including three computers, two switches, a router and a firewall with a rule.
442
+ This rule allows computer with IP 192.168.0.20 to communicate with computer 192.168.0.22.
443
+ \begin{figure}[h]
444
+ \center
445
+ \includesvg[scale=0.55]{chapter3/NetzwerkGraph.svg}
446
+ \caption{An example network graph.}
447
+ \label{fig:netzwerk_graph}
448
+ \end{figure}
449
+
450
+ \subsection{Model Attacks} \label{subsec:model_attacks}
451
+ Multi-staged attacks are represented as directed graphs $G_{att} = (V_{att}, E_{att})$.
452
+ It should be noted that these are not attack graphs in a traditional sense.
453
+ The set of nodes $V_{att}$ represents wildcards, which later have to be filled with nodes from the network graph to execute an attack.
454
+ $V_{att}$ consists of a subset of the natural numbers:
455
+ \begin{align}
456
+ V_{att} \subseteq & \mathbf{N}
457
+ \end{align}
458
+ The edge set $E_{att}$ represents the single step attacks that occur between the nodes and together represent the multi-staged attack.
459
+ To model the attacks $E_{att}$ the techniques and tactics of the MITRE ATT\&CK Matrix are needed.
460
+ Both are represented by a set containing the IDs.
461
+ \begin{align}
462
+ \text{Tactics} =& \{\text{T0100, T0101, ..., T0111,} \nonumber \\
463
+ & \text{T0001, T0002, ..., T0011,} \nonumber \\
464
+ & \text{T0040, T0042, T0043}\} \\
465
+ \text{Techniques} =& \{ \text{T0800, T0801, ..., T0891,} \nonumber\\
466
+ & \text{T1001, T1003, ..., T1649}\}
467
+ \end{align}
468
+ With this information, $E_{att}$ can be formally stated as:
469
+ \begin{align}
470
+ E_{att} \subset & \{(v_1,v_2, step, tactic, technique)| \nonumber \\
471
+ & v_1,v_2 \in V, \nonumber \nonumber \\
472
+ & step \in \mathbf{N}, \nonumber \nonumber \\
473
+ & tactic \in \text{Tactics}, \nonumber \nonumber \\
474
+ & technique \in \text{Technique}\}
475
+ \end{align}
476
+ Each attack configuration also contains exactly one root node from which the attack originates.
477
+ It additionally contains a single MITRE platform, which specifies the device type where the attack starts.
478
+ For the remaining nodes, possible MITRE platforms can derived from the incoming edges.
479
+ For this, the MITRE ATT\&CK matrix is used again.
480
+ It provides a mapping $TechniqueToPlatforms$ that assigns each MITRE technique to a subset of the MITRE platforms.
481
+ This subset represents possible targets for the technique.
482
+ If a node has only one incoming edge, the platforms can be found directly via $TechniqueToPlatforms$.
483
+ If a node has several incoming edges, all platforms for the individual techniques must first be determined using $TechniqueToPlatforms$.
484
+ After that the intersection of the different platform sets must be formed.
485
+ The Platforms that are in the intersection are common goals of the different techniques.
486
+ An example of an attack configuration $G_{att}$ can be seen in the Figure~\ref{fig:attack_graph}.
487
+ \begin{figure}[h]
488
+ \center
489
+ \includesvg[scale=0.55]{chapter3/AngriffsGraph.svg}
490
+ \caption{A example attack graph.}
491
+ \label{fig:attack_graph}
492
+ \end{figure}
493
+
494
+
495
+ \subsection{Data Synthesis} \label{subsec:data_synthesis}
496
+ The attack configurations discussed in Section~\ref{subsec:model_attacks} are now used together with the network configurations from Section~\ref{subsec:model_network} to generate appropriate \ac{ids} alerts.
497
+ For this, the instances of the attack configuration for the network configuration must be found.
498
+ An instance of an attack is represented by a mapping function, denoted as $F$, which assigns nodes from the set of attack nodes, $V_{att}$, to nodes in the network, $V_{net}$.
499
+ For any pair of nodes, $x_1$ and $x_2$, in $V_{att}$ that have an edge between them, denoted as $E x_1,x_2$, the function $F$ must map the nodes such that $F(x_1)$ and $F(x_2)$ are in $V_{net}$ and $F(x_1)$ can communicate with $F(x_2)$, as outlined in Section~\ref{subsec:model_network}.
500
+ Additionally, for each node $x_1$ in $V_{att}$, the platform of the node $F(x_1)$ must be present in the platform set of node $x_1$, as outlined in Section~\ref{subsec:model_attacks}.
501
+ To find all instances, a complete graph traversal is performed using an algorithm described in Listing~\ref{lst:instance_algorithm}.
502
+ The function $network\textunderscore graph.get\textunderscore step\textunderscore values(attack\textunderscore edges)$ is used to find a set of possible solutions for each attack step in $E_{att}$ that comply with the conditions stated above.
503
+ These sets are called $step\textunderscore values$.
504
+ To generate instances from these partial solutions, the function $solve\textunderscore attack\textunderscore step$ is called for each attack step with the corresponding $step\textunderscore values$.
505
+ The result is a list of dictionaries, where each dictionary represents the function $F$ and thus represents an instance of an attack.
506
+ \begin{adjustwidth}{6mm}{}
507
+ \begin{lstlisting}[
508
+ numbers=left,
509
+ captionpos=b,
510
+ language=Python,
511
+ label=lst:instance_algorithm,
512
+ caption=Algorithm for finding all instances of an attack on a network.,
513
+ basicstyle=\tiny, ]
514
+
515
+ def solve_attack_step(attack_edge, step_values, instances):
516
+ new_instances = []
517
+ x1, x2 = attack_edge
518
+ for instance in instances:
519
+ for n1, n2 in step_values:
520
+ i_copy = instance.copy()
521
+
522
+ if i_copy[src] is None and i_copy[target] is None:
523
+ i_copy[src] = n1
524
+ i_copy[target] = n2
525
+ new_instances.append(i_copy)
526
+
527
+ elif i_copy[src] == n1 and i_copy[target] == n2:
528
+ new_instances.append(i_copy)
529
+
530
+ elif i_copy[src] is None:
531
+ if i_copy[target] == n2:
532
+ i_copy[src] = n1
533
+ new_instances.append(i_copy)
534
+
535
+ elif i_copy[target] is None:
536
+ if i_copy[src] == n1:
537
+ i_copy[target] = n2
538
+ new_instances.append(i_copy)
539
+ return new_instances
540
+
541
+ def find_all_instances(network_graph, attack_graph):
542
+ attack_edges = attack_graph.get_edges()
543
+ step_values = network_graph.get_step_values(attack_edges)
544
+ instances = []
545
+ for i, pair in enumerate(attack_edges):
546
+ instances = solve_attack_step(pair, step_values[i], instances)
547
+ return instances
548
+ \end{lstlisting}
549
+ \end{adjustwidth}
550
+ Figure~\ref{fig:netzwerk_attack_graph} shows an attack instance of the attack defined in Figure~\ref{fig:attack_graph}, executed on the network in Figure~\ref{fig:netzwerk_graph}.
551
+ To verify that this instance is valid, there are several conditions that must be met.
552
+ Firstly, the root of the attack must be a node that uses the Linux MITRE platform, which is confirmed in this case.
553
+ Secondly, the MITRE techniques used in the attack must match the platforms of the target nodes.
554
+ In this instance, node 192.168.0.21 uses technique T1190 to attack node 192.168.0.20.
555
+ T1190 is known to target Linux, Network, Windows and macOS platforms, thus the platform condition is fulfilled.
556
+ In the second step, node 192.168.0.20 uses technique T0836 to attack node 192.168.0.22, T0836 can target Control Server, Field Controller, HM and SIS, fulfilling this condition as well.
557
+ Finally, the nodes must be able to communicate with each other.
558
+ There is no firewall between nodes 192.168.0.21 and 192.168.0.20, they are connected to a switch, they can communicate with each other.
559
+ However, on the path between nodes 192.168.0.20 and 192.168.0.22, there is a firewall which allows communication for node 192.168.0.20 on the path $ 20 \rightarrow 2 \rightarrow 3 \rightarrow 4 \rightarrow 22$ (IP addresses without Prefix 192.168.0.).
560
+ Therefore, all conditions are met and this instance is valid.
561
+ \begin{figure}[h]
562
+ \center
563
+ \includesvg[scale=0.55]{chapter3/NetzwerkGraphAttack.svg}
564
+ \caption{A instance of the Attack from Figure~\ref{fig:netzwerk_graph} executed on the network graph from Figure~\ref{fig:attack_graph}.}
565
+ \label{fig:netzwerk_attack_graph}
566
+ \end{figure}
567
+ The next step is to convert the instances of the attack into \ac{ids} alerts.
568
+ This process requires the mapping function $F$, and the network graph $G_{net}$ and the attack graph $G_{att}$.
569
+ For each attack edge $(x_1,x_2) \in E_{att}$, it is verified if the path between the nodes $F(x_1)$ and $F(x_2)$ in the network graph contains a switch that is configured as \ac{ids}.
570
+ If such a switch exists, an alert is generated with the attributes listed in Table~\ref{tab:abstracted_alerts}.
571
+ The IP addresses and MITRE platforms are obtained from the network graph $G_{net}$, while the MITRE tactic, technique and attack label are obtained from the corresponding edges in the attack graph $G_{att}$.
572
+ These alerts are considered \acp{tp}, thus the \ac{fp} flag is set to False.
573
+ The alerts generated for the instance in Figure~\ref{fig:netzwerk_attack_graph} can be found in Table~\ref{tab:generierte_alerts}.
574
+ \begin{table}
575
+ \center
576
+ \caption{This table shows the alerts that were generated with the example instance in Figure~\ref{fig:netzwerk_attack_graph}.}
577
+ \begin{tabular}{lll}
578
+ \textbf{Name} & \textbf{Alert 1} & \textbf{Alert 2}\\
579
+ \hline
580
+ Source-IP & 192.168.0.21 & 192.168.0.20 \\
581
+ Target-IP & 192.168.0.20 & 192.168.0.22 \\
582
+ Source-Plattform & Computer & Computer \\
583
+ Target-Plattform & Computer & Field Controller\\
584
+ MITRE-Taktik & TA0001 & TA1190 \\
585
+ MITRE-Technik & TA0106 & TA0106 \\
586
+ Sensor-IP & 192.168.0.2 & 192.168.0.2 \\
587
+ \ac{fp}-FLAG & False & False \\
588
+ Attack-Label & Attack\_1 & Attack\_1
589
+ \end{tabular}
590
+ \label{tab:generierte_alerts}
591
+ \end{table}
592
+ There are two methods for adding \acp{fn} to the generated \ac{ids} alerts.
593
+ One method is to selectively omit certain \ac{ids} devices from the network, which will increase the rate of \acp{fn} since attacks will go undetected.
594
+ Another method is to randomly remove \acp{tp} from the data, which allows for more precise control over the proportion of \acp{fn}.
595
+ This second method will be used here.
596
+ In addition to generating \acp{fn} and \acp{tp}, it is also necessary to generate \acp{fp}.
597
+ To do so, two nodes, $x_1,x_2$, are randomly selected from the network graph $G_{net}$, and it is checked if $x_1$ can communicate with $x_2$, and if there is an \ac{ids} device on the communication path.
598
+ If such nodes are found, a suitable attack is randomly selected from the MITRE ATT\&CK matrix and an alert is generated with it.
599
+ \section{Evaluation \& Discussion} \label{sec:result}
600
+ In this section, we evaluate the effectiveness of using synthesized data for \ac{ml}-based \ac{ids} by testing the performance of \ac{mlp} and \ac{lstm} models, which are trained with synthesized data.
601
+ The models are tested on both synthesized data and a data set from a laboratory experiment, evaluating both alert classification and attack detection.
602
+ Additionally, the models are tested with both the full set of alert attributes and a reduced set of attributes that exclude the MITRE Tactic and Technique.
603
+
604
+ \subsection{Procedure for Investigation} \label{subsec:result_procedure}
605
+ The investigation will be carried out as follows.
606
+ First, configurations for the data synthesis framework are created for various scenarios.
607
+ Then \ac{ids}-alert data sets with the required properties (\ac{tp}-rate \ac{fn}-rate and \ac{fp}-rate) are generated.
608
+ Finally, \ac{mlp} and \ac{lstm} models are trained on this data and the performance will be measured.
609
+ For the \ac{lstm} network, 2 layers are used.
610
+ The first is an \ac{lstm} layer with 300 units and a dropout of 0.2 units and a dropout of 0.2.
611
+ This layer receives a two-dimensional input whose size is equal to the feature vector times the length of the sequence.
612
+ Three layers are used for the \ac{mlp}.
613
+ These include an input layer, a hidden layer, and an output layer.
614
+ The input layer has the size of the feature vector.
615
+ For the hidden layer, a dense layer is always used in the \ac{mlp}.
616
+ This has a size of 200 and uses the ReLU function as activation function.
617
+ To give an indication of the performance on real data, the \ac{ml} models, which are trained on the synthesized data, getting tested with the data from a lab experiment.
618
+ For this purpose, the \ac{pcap} file of the laboratory experiment must be manually transferred to the abstract data format (cf.\ Section~\ref{subsec:data_abstraction}).
619
+
620
+ \subsection{Scenarios} \label{subsec:scenarios}
621
+ The network configuration used in the study were developed using the \ac{pera} and the \ac{nist} publication \textit{Guide to Industrial Control Systems Security}.
622
+ The \ac{nist} publication contains recommendations for securing \ac{ics} networks and, in particular, structures for network architectures ~\cite{Stouffer.2015}.
623
+ The multi-stage attack configurations used in the study were created using the \ac{ics} kill chain and the MITRE software database.
624
+ The \ac{ics} kill chain describes cyberattacks that aim to destroy the \ac{ics} infrastructure or temporarily disrupt production.
625
+ The MITRE software database divides software into tools and malware.
626
+ For each software, the MITRE techniques used are listed.
627
+ In addition, each technique has an explanation of exactly what it is used for.
628
+ The created configurations replicate attacks of known malware.
629
+ Among them are Stuxnet, Industroyer, WannaCry and PLC-Blaster.
630
+
631
+ \subsection{Data Set Creation} \label{subsec:dataset_creation}
632
+ To generate data with the presented framework in a way that \ac{ml} models can utilize them, larger datasets have to be generated.
633
+ In this work, datasets were generated by producing \ac{ids} alerts for a specific network configuration with a set of different attacks.
634
+ The number of alerts for an attack configuration can be chosen arbitrarily.
635
+ In addition, attributes of the whole dataset, such as the ratio of \ac{tp} to \ac{fp} or \ac{tp} to \ac{fn}, can be controlled.
636
+ This is helpful to generate the appropriate training datasets for the different applications of the \ac{ml} models.
637
+ In our case these are the alert classification and the attack detection.
638
+
639
+ \subsection{PCAP Transformation} \label{subsec:pcap_transformation}
640
+ The data of the laboratory experiment contains the network traffic of a test network in which the WannaCry ransomware is spreading~\cite{DavidSzili.2017}.
641
+ To make the network packets of a \ac{pcap} file usable for our \ac{ml} models, they first have to be converted into the abstracted \ac{ids} alerts.
642
+ To generate \ac{ids} alerts from a \ac{pcap} file, the \ac{ids} Snort is used.
643
+ Snort is a rule-based \ac{ids} and can also apply rules to archived data in the form of \acp{pcap} ~\cite{SnortProject.2020}.
644
+ In this work the Emerging Threats ruleset is used ~\cite{ProofpointInc.2022}.
645
+ By applying the ruleset, the \ac{pcap} file with 46654 network packets is converted into a log file with 7874 alerts.
646
+ This list contains a lot of duplicate alerts.
647
+ To filter them out, duplicates that follow each other directly in time are removed.
648
+ This reduces the number of alerts to 5406.
649
+ These generated alerts contain a timestamp, the rule ID, a description, the protocol and the IP addresses.
650
+ The number of alerts must be further reduced to manually assign labels.
651
+ For this purpose, the priorities specified in the definition of each rule are used.
652
+ All alerts with a low priority are removed.
653
+ After this step, 66 alerts remain, which were generated by seven different rules.
654
+ For these 66 alerts we have to manually assign MITRE ATT\&CK tactics and techniques, while the alerts generated by the same rule get the same tactics or techniques.
655
+ Using the manually assigned MITRE information and the knowledge about the platforms of the devices in the \ac{pcap}, the 66 alerts are transferred into the abstracted alert format.
656
+ The Sensor ID attribute is ignored because the \ac{pcap} file does not contain any information about sensors.
657
+ The \ac{fp} label is set to False and the Attack label is set to WannaCry, since the \ac{pcap} contains only the WannaCry attack.
658
+ \acp{fp} are needed to complete the dataset.
659
+ These are generated using the synthesis environment for the period of the WannaCry attack.
660
+ The final data set has 10 times as many \ac{fp} as \ac{tp}.
661
+ Thus, the data set consists of 66 \ac{tp} and 660 \acp{fp}.
662
+
663
+ \subsection{Result} \label{subsec:result}
664
+ The results in this section were generated through a thorough process of training and testing the \ac{ml} algorithms multiple times.
665
+ The consistency in the results indicates the robustness of the models and the lack of significant difference in multiple runs of the algorithm makes it unnecessary to include standard deviation in the graphs.
666
+ Additionally, the models have not been fine-tuned to their full potential, indicating room for improvement.
667
+ Therefore, these results can be considered as a strong starting point for further optimization and refinement.
668
+ The first experiment tests the performance of the \ac{ml} models for alert classification.
669
+ Here, the \ac{ml} models should recognize the \ac{tp} and thus separate them from the \ac{fp} to simplify the manual processing of \ac{ids} alerts by the operator of the \ac{sg}.
670
+ For this two datasets were generated with $0\%$ \ac{fn} and with a \ac{tp} to \ac{fp} ratio of $100\%$.
671
+ Alerts for attacks were generated until 2000 alerts were collected for each attack mentioned in Section~\ref{subsec:scenarios}.
672
+ This means that the datasets contain a total of 8000 \ac{tp} and 8000 \ac{fp}, this results in a balanced dataset.
673
+ The \ac{mlp} and \ac{lstm} are trained on the first data set and tested on the second one.
674
+ The results of this test can be shown as a roc curve because we are looking at a binary classification tested on a balanced dataset.
675
+ This roc curve is shown in Figure~\ref{fig:roc-alert-classification-synthetic-data}.
676
+ It was expected that the \ac{lstm} would perform better than the \ac{mlp}, since the \ac{lstm} can correlate successive alerts and thus derive further insights.
677
+ The \ac{mlp}, on the other hand, can only look at individual alerts.
678
+ The roc curve shows that the \ac{lstm} performs better on the whole data set as well as on the data set which only uses the attributes source-IP, target-IP, source-platform and target-platform.
679
+ \begin{figure}[h]
680
+ \center
681
+ \includesvg[scale=0.60]{chapter4/roc_alert_classification_synthetic_data.svg}
682
+ \caption{Alert classification results on synthesized data. $x_{axis} \in \{0, 0.2\}$ and $y_{axis} \in \{0.6, 1.0\}$}
683
+ \label{fig:roc-alert-classification-synthetic-data}
684
+ \end{figure}
685
+ Next, the performance of the \ac{ml} models trained on the synthesized data is tested on the laboratory data set from Section~\ref{subsec:pcap_transformation}.
686
+ The results are visualized here as bar diagram of the \ac{tp} rate and the \ac{fn} rate.
687
+ The roc curve cannot be used here because this is not a balanced data set.
688
+ On the complete dataset the performance of the models is very good, reaching a \ac{tp} rate of $0.99$ and on the subset of the data set a \ac{tp} rate over $0.8$.
689
+ The expected performance difference between the two models cannot be confirmed here.
690
+ Here, the \ac{lstm} model no longer provides the expected advantage.
691
+ \begin{figure}[h]
692
+ \center
693
+ \includesvg[scale=0.60]{chapter4/tpr_fnr_alert_classification_labor_data.svg}
694
+ \caption{Alert classification results on laboratory data.}
695
+ \label{fig:tpr-fnr-alert-classification-labor-data}
696
+ \end{figure}
697
+ The next experiment tests the performance of the \ac{ml} models for attack detection.
698
+ Here, the \ac{ml} models should recognize the ongoing Attack so that \ac{sg} operators can take appropriate countermeasures.
699
+ For this two data sets were generated with $0\%$ \ac{fn} and with a \ac{tp} to \ac{fp} ratio of $0.25$.
700
+ Again, alerts were generated until 2000 alerts were collected for each attack.
701
+ This means that the data sets contain a total of 2000 for each attack and 2000 \ac{fp}, so again balanced but over 5 classes.
702
+ In this experiment, the \ac{ml} models must assign the alerts to one of these 5 classes: Stuxnet, Industroyer, WannaCry and PLC-Blaster or False-Positive.
703
+ The \ac{mlp} and \ac{lstm} are trained on the first data set and tested on the second one.
704
+ The results of this test can be shown as bar diagram, which takes the accuracy and recall into account.
705
+ The class of false positives (n.A. = no attack) is considered individually, since there should be as few \ac{tp} alerts as possible sorted into this class to not miss any attacks in the network.
706
+ The results are shown in Figure~\ref{fig:precision-recall-attack-detection-synthetic-data}.
707
+ The results for the detection of \ac{fp} (or no attack) for both models do not differ significantly, just as in the previous experiment.
708
+ This can be seen from the fact that the Precision and the Recall for the class \textit{no Attack} are in the same region.
709
+ When detecting to which attack an alert belongs, alerts must be correlated to improve detection performance, since the same alert can belong to multiple attacks.
710
+ This reveals the strength of \ac{lstm}.
711
+ The average precision and recall across all classes is 10 percentage points higher with \ac{lstm} than with \ac{mlp}.
712
+ This holds for the whole data set as well as for the subset.
713
+ \begin{figure}[h]
714
+ \center
715
+ \includesvg[scale=0.60]{chapter4/precision_recall_attack_detection_synthetic_data.svg}
716
+ \caption{Attack detection results on synthesized data (n.A = no Attack). $y_{axis} \in \{0.5, 1.0\}$}
717
+ \label{fig:precision-recall-attack-detection-synthetic-data}
718
+ \end{figure}
719
+ Lastly, the performance of the \ac{ml} models trained on synthesized data of the previous experiment is tested on the laboratory dataset.
720
+ The results are shown in Figure~\ref{fig:precision-recall-attack-detection-labor-data}.
721
+ Again, the advantages of the \ac{lstm} are no longer apparent.
722
+ \begin{figure}[h]
723
+ \center
724
+ \includesvg[scale=0.60]{chapter4/precision_recall_attack_detection_labor_data.svg}
725
+ \caption{Attack detection results on laboratory data (n.A = no Attack).}
726
+ \label{fig:precision-recall-attack-detection-labor-data}
727
+ \end{figure}
728
+
729
+ \subsection{Discussion} \label{subsec:result_dis}
730
+ In this section, the results of Section~\ref{subsec:result} are critically reviewed.
731
+ Although the results of the \ac{ml} models are promising, this is not an indication that proposed approach is transferable to real scenarios for the following reasons.
732
+ The results of the \ac{lstm} were always better than those of the \ac{mlp} in the experiments with the synthetic data.
733
+ This indicates that the synthetic data contains a structure that can be recognized by the \ac{lstm}.
734
+ The data from the laboratory experiment did not show such a clear performance advantage for the \ac{lstm}.
735
+ This suggests that the attacks in the lab data do not have the same structure.
736
+ This could be due to the manual steps necessary to convert the \ac{pcap} into a usable format.
737
+ A second reason could be that in the data set the \ac{fp} is so strongly overweighted.
738
+ This could have made the examined sequence length of the \ac{lstm} too small.
739
+ Another point that needs to be addressed is the performance of the \ac{ml} models.
740
+ The \ac{tp} rate of the models is very close to 100\%.
741
+ This is usually a sign that the models are being used incorrectly or that the training data contains data that should not be there, such as labels.
742
+ In our case, it is likely that the models can separate the \ac{tp} and \ac{fp} alerts too well via the MITRE tactic and technique attribute.
743
+ In the attack configurations only a small subset of all techniques are used.
744
+ This means that a large part of the \acp{fp} can be detected by their techniques, because they are exclusively used in the \acp{fp}.
745
+ This leads to the next problem is the \ac{fp} generation.
746
+ The \ac{fp} from the synthesis environment are randomly generated.
747
+ As already stated this is a problem because the attacks configured in the study does not cover all techniques.
748
+ \ac{fp} found in real environments are not random and can occur for many different reasons, such as bad configurations or hardware errors.
749
+ Also, the framework and the \ac{ml} models were not tested extensively.
750
+ The reason for this is that all configurations in this work were configured manually.
751
+ The results were generated with a set of 4 attack configurations and only one network configuration.
752
+ To make a statement about whether the synthesized data can be used for \ac{ml} based \ac{ids}, these test cases should be greatly expanded.
753
+ Nevertheless, synthetic data has been shown to have many advantages.
754
+ Among them are availability and the flexibility to generate data for different problems.
755
+ Another advantage is that the data can be generated in a way that they are optimally suited for training \ac{ml} models.
756
+ \section{Conclusion} \label{sec:conclusion}
757
+ To improve the security of \acp{sg}, \ac{ml}-based \acp{ids} are being implemented to detect attacks at an early stage.
758
+ However, these systems require training data, which is often not available or suitable.
759
+ This work investigated whether abstracted and synthetically generated data can be used to train \ac{ml}-based \acp{ids}.
760
+ The investigation focused on \ac{ids} log files as a suitable data format for abstraction and synthesis.
761
+ A system was presented that simulates multi-stage attacks on a network graph using the MITRE ATT\&CK matrix, and generates \ac{ids} log files containing \acp{tp}, \acp{fp}, and \acp{fn}.
762
+ The influence of the individual parameters of the abstracted data format on the performance of the \ac{ml} models was investigated, and it was found that the MITRE ATT\&CK related information in the \ac{ids} log files had the largest influence on their performance.
763
+ The \ac{ml} models were also tested on a dataset containing real attack data and were able to separate \ac{tp} from \ac{fp} and assign them to correct attacks.
764
+ The resulting performance is promising in terms of training anomaly detection systems for SG without requiring a large number of datasets for training.
765
+ Future work will address the study of synthetic, multi-stage cyberattacks in laboratory environments using digital twin approaches where the reference grid is replicated in our framework and a comparision with the lab is performed.
766
+ In addition, other constellations of dataset construction will be investigated, e.g.\ the degree of blending of real and synthetic data also in terms of recognition and classification performance.
767
+
768
+
769
+
770
+ \begin{thebibliography}{10}
771
+ \providecommand{\url}[1]{#1}
772
+ \csname url@samestyle\endcsname
773
+ \providecommand{\newblock}{\relax}
774
+ \providecommand{\bibinfo}[2]{#2}
775
+ \providecommand{\BIBentrySTDinterwordspacing}{\spaceskip=0pt\relax}
776
+ \providecommand{\BIBentryALTinterwordstretchfactor}{4}
777
+ \providecommand{\BIBentryALTinterwordspacing}{\spaceskip=\fontdimen2\font plus
778
+ \BIBentryALTinterwordstretchfactor\fontdimen3\font minus
779
+ \fontdimen4\font\relax}
780
+ \providecommand{\BIBforeignlanguage}[2]{{\expandafter\ifx\csname l@#1\endcsname\relax
781
+ \typeout{** WARNING: IEEEtran.bst: No hyphenation pattern has been}\typeout{** loaded for the language `#1'. Using the pattern for}\typeout{** the default language instead.}\else
782
+ \language=\csname l@#1\endcsname
783
+ \fi
784
+ #2}}
785
+ \providecommand{\BIBdecl}{\relax}
786
+ \BIBdecl
787
+
788
+ \bibitem{vale2010distributed}
789
+ Z.~Vale \emph{et~al.}, ``Distributed energy resources management with
790
+ cyber-physical scada in the context of future smart grids,'' in \emph{IEEE
791
+ Mediterranean Electrotechnical Conference}, 2010.
792
+
793
+ \bibitem{hossain2013smart}
794
+ M.~R. Hossain \emph{et~al.}, ``Smart grid,'' in \emph{Smart Grids}, 2013.
795
+
796
+ \bibitem{vandervelde2020methods}
797
+ D.~van~der Velde \emph{et~al.}, ``{Methods for Actors in the Electric Power
798
+ System to Prevent, Detect and React to ICT Attacks and Failures},'' in
799
+ \emph{IEEE ENERGYCon}, 2020.
800
+
801
+ \bibitem{yan2012survey}
802
+ Y.~Yan \emph{et~al.}, ``A survey on cyber security for smart grid
803
+ communications,'' \emph{IEEE communications surveys \& tutorials}, 2012.
804
+
805
+ \bibitem{mathas2020threat}
806
+ C.-M. Mathas \emph{et~al.}, ``Threat landscape for smart grid systems,'' in
807
+ \emph{ARES}, 2020.
808
+
809
+ \bibitem{kawoosa2021review}
810
+ A.~I. Kawoosa \emph{et~al.}, ``A review of cyber securities in smart grid
811
+ technology,'' in \emph{ICCAKM}.\hskip 1em plus 0.5em minus 0.4em\relax IEEE,
812
+ 2021.
813
+
814
+ \bibitem{sridhar2011cyber}
815
+ S.~Sridhar \emph{et~al.}, ``Cyber--physical system security for the electric
816
+ power grid,'' \emph{Proceedings of the IEEE}, 2011.
817
+
818
+ \bibitem{krause2021cybersecurity}
819
+ T.~Krause \emph{et~al.}, ``{Cybersecurity in Power Grids: Challenges and
820
+ Opportunities},'' \emph{Sensors}, 2021.
821
+
822
+ \bibitem{demertzis2018next}
823
+ K.~Demertzis \emph{et~al.}, ``The next generation cognitive security operations
824
+ center: network flow forensics using cybersecurity intelligence,'' \emph{Big
825
+ Data and Cognitive Computing}, 2018.
826
+
827
+ \bibitem{burstein2008toward}
828
+ A.~J. Burstein, ``{Toward a culture of cybersecurity research},'' \emph{UC
829
+ Berkeley Public Law Research Paper}, 2008.
830
+
831
+ \bibitem{zarpelao2020machine}
832
+ B.~B. Zarpel{\~a}o \emph{et~al.}, ``How machine learning can support
833
+ cyberattack detection in smart grids,'' in \emph{Artificial Intelligence
834
+ Techniques for a Scalable Energy Transition}, 2020.
835
+
836
+ \bibitem{ashok2016powercyber}
837
+ A.~Ashok \emph{et~al.}, ``Powercyber: A remotely accessible testbed for cyber
838
+ physical security of the smart grid,'' in \emph{IEEE ISGT}, 2016.
839
+
840
+ \bibitem{assante2015industrial}
841
+ M.~J. Assante \emph{et~al.}, ``The industrial control system cyber kill
842
+ chain,'' \emph{SANS Institute}, 2015.
843
+
844
+ \bibitem{hossain2012smart}
845
+ E.~Hossain \emph{et~al.}, \emph{Smart grid communications and
846
+ networking}.\hskip 1em plus 0.5em minus 0.4em\relax Cambridge University
847
+ Press, 2012.
848
+
849
+ \bibitem{Zscaler.2022}
850
+ K.~Es-Salhi, ``Segmentation and segregation mechanisms and models to secure the
851
+ integration of industrial control systems (ics) with corporate system,''
852
+ Ph.D. dissertation, 2019.
853
+
854
+ \bibitem{baptiste2021systematic}
855
+ M.~Baptiste \emph{et~al.}, ``Systematic and efficient anomaly detection
856
+ framework using machine learning on public ics datasets,'' in \emph{IEEE
857
+ CSR}, 2021.
858
+
859
+ \bibitem{perales2020madics}
860
+ {\'A}.~L. Perales~G{\'o}mez \emph{et~al.}, ``Madics: A methodology for anomaly
861
+ detection in industrial control systems,'' \emph{Symmetry}, 2020.
862
+
863
+ \bibitem{wolsing2022ipal}
864
+ K.~Wolsing \emph{et~al.}, ``{IPAL: Breaking up Silos of Protocol-dependent and
865
+ Domain-specific Industrial Intrusion Detection Systems},'' in \emph{RAID},
866
+ 2022.
867
+
868
+ \bibitem{sen2022onusing}
869
+ {\"O}.~Sen \emph{et~al.}, ``{On Using Contextual Correlation to Detect
870
+ Multi-stage Cyber Attacks in Smart Grids},'' \emph{Sustainable Energy, Grids
871
+ and Networks}, vol.~32, 12 2022.
872
+
873
+ \bibitem{kus2022afalse}
874
+ D.~Kus \emph{et~al.}, ``{A False Sense of Security? Revisiting the State of
875
+ Machine Learning-Based Industrial Intrusion Detection},'' in \emph{CPSS},
876
+ 2022.
877
+
878
+ \bibitem{ju2020mckc}
879
+ A.~Ju \emph{et~al.}, ``Mckc: a modified cyber kill chain model for cognitive
880
+ apts analysis within enterprise multimedia network,'' \emph{Multimedia Tools
881
+ and Applications}, 2020.
882
+
883
+ \bibitem{yadav2015technical}
884
+ T.~Yadav \emph{et~al.}, ``Technical aspects of cyber kill chain,'' in
885
+ \emph{International symposium on security in computing and communication},
886
+ 2015.
887
+
888
+ \bibitem{alexander2020mitre}
889
+ O.~Alexander \emph{et~al.}, ``Mitre att\&ck for industrial control systems:
890
+ Design and philosophy,'' \emph{The MITRE Corporation}, 2020.
891
+
892
+ \bibitem{TheMITRECorporation.1182022}
893
+ W.~Xiong \emph{et~al.}, ``Cyber security threat modeling based on the mitre
894
+ enterprise att\&ck matrix,'' \emph{Software and Systems Modeling}, 2022.
895
+
896
+ \bibitem{choi2019comparison}
897
+ S.~Choi \emph{et~al.}, ``A comparison of ics datasets for security research
898
+ based on attack paths,'' in \emph{International Conference on Critical
899
+ Information Infrastructures Security}.\hskip 1em plus 0.5em minus 0.4em\relax
900
+ Springer, 2019.
901
+
902
+ \bibitem{choi2021probabilistic}
903
+ S.~Choi \emph{et~al.}, ``Probabilistic attack sequence generation and execution
904
+ based on mitre att\&ck for ics datasets,'' in \emph{Cyber Security
905
+ Experimentation and Test Workshop}, 2021.
906
+
907
+ \bibitem{sharafaldin2018toward}
908
+ I.~Sharafaldin \emph{et~al.}, ``Toward generating a new intrusion detection
909
+ dataset and intrusion traffic characterization.'' \emph{ICISSp}, 2018.
910
+
911
+ \bibitem{cordero2021generating}
912
+ C.~G. Cordero \emph{et~al.}, ``On generating network traffic datasets with
913
+ synthetic attacks for intrusion detection,'' \emph{ACM TOPS}, 2021.
914
+
915
+ \bibitem{pandey2021gan}
916
+ S.~K. Pandey \emph{et~al.}, ``Gan-based data generation approach for ids:
917
+ Evaluation on decision tree,'' in \emph{AISC: V14}, 2021.
918
+
919
+ \bibitem{gwon2019network}
920
+ H.~Gwon \emph{et~al.}, ``Network intrusion detection based on lstm and feature
921
+ embedding,'' \emph{arXiv:1911.11552}, 2019.
922
+
923
+ \bibitem{oliveira2021intelligent}
924
+ N.~Oliveira \emph{et~al.}, ``Intelligent cyber attack detection and
925
+ classification for network-based intrusion detection systems,'' \emph{Applied
926
+ Sciences}, 2021.
927
+
928
+ \bibitem{MarkBristow.2021}
929
+ M.~Bristow, ``A sans 2021 survey: Ot/ics cybersecurity,'' \emph{eng. In}, 2021.
930
+
931
+ \bibitem{SnortProject.2020}
932
+ B.~Caswell \emph{et~al.}, \emph{Snort 2.1 intrusion detection}.\hskip 1em plus
933
+ 0.5em minus 0.4em\relax Elsevier, 2004.
934
+
935
+ \bibitem{RDFLibTeam.rdf.2022}
936
+ M.~A. Bamboat \emph{et~al.}, ``Performance of rdf library of java, c\# and
937
+ python on large rdf models.''
938
+
939
+ \bibitem{RDFLibTeam.pyshacl.2022}
940
+ J.~E. Labra~Gayo \emph{et~al.}, ``Rdfshape: An rdf playground based on
941
+ shapes,'' in \emph{Proceedings of ISWC}, 2018.
942
+
943
+ \bibitem{Stouffer.2015}
944
+ K.~Stouffer \emph{et~al.}, ``Guide to industrial control systems (ics)
945
+ security,'' \emph{NIST}, 2011.
946
+
947
+ \bibitem{DavidSzili.2017}
948
+ \BIBentryALTinterwordspacing
949
+ {David Szili}, ``pcap of wannacry spreading using etnernalblue,'' 2017.
950
+ [Online]. Available:
951
+ \url{https://www.malware-traffic-analysis.net/2017/05/18/index2.html}
952
+ \BIBentrySTDinterwordspacing
953
+
954
+ \bibitem{ProofpointInc.2022}
955
+ \BIBentryALTinterwordspacing
956
+ {Proofpoint Inc}, ``Emerging threats rules,'' 2022. [Online]. Available:
957
+ \url{https://rules.emergingthreats.net/}
958
+ \BIBentrySTDinterwordspacing
959
+
960
+ \end{thebibliography}
961
+
962
+
963
+ \end{document}