Multi-Stage Attack Detection via Kill Chain State Machines
Florian Wilkens, Felix Ortmann, Steffen Haas, Matthias Vallentin,, Mathias Fischer

TL;DR
This paper introduces a method to synthesize attack graphs from network alerts into kill chain state machines, significantly reducing alert volume and aiding analysts in detecting complex threats like APTs.
Contribution
We develop a novel approach to generate attack scenario graphs from alerts using kill chain state machines, improving detection and triage of sophisticated cyber threats.
Findings
Up to 446,458 alerts condensed into 700 attack graphs
Reduction of alert volume by up to three orders of magnitude
Effective detection and contextualization of APT campaigns
Abstract
Today, human security analysts collapse under the sheer volume of alerts they have to triage during investigations. The inability to cope with this load, coupled with a high false positive rate of alerts, creates alert fatigue. This results in failure to detect complex attacks, such as advanced persistent threats (APTs), because they manifest over long time frames and attackers tread carefully to evade detection mechanisms. In this paper, we contribute a new method to synthesize attack graphs from state machines. We use the network direction to derive potential attack stages from single and meta-alerts and model resulting attack scenarios in a kill chain state machine (KCSM). Our algorithm yields a graphical summary of the attack, APT scenario graphs, where nodes represent involved hosts and edges infection activity. We evaluate the feasibility of our approach in multiple experiments…
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.
