A Framework for Developing Strategic Cyber Threat Intelligence from Advanced Persistent Threat Analysis Reports Using Graph-Based Algorithms
Preprint
- 17 July 2024
- preprint
- Published by MDPI AG in Preprints.org
Abstract
Advanced persistent threat (APT) attacks are sophisticated and organized attacks commonly motivated by political, financial, and strategic objectives. In order to comprehend their tactics, techniques, and procedures (TTP) and indicators, APT reports are valuable sources. While blue teams typically rely on server logs, firewall rules and user authorizations managed in database tables, attackers have a graph-based mindset. In this work, we propose a framework for discovering and evaluating APTs using graph-based algorithms. Cyber threat intelligence (CTI) was extracted from 40,358 pages of APT reports and transformed into a graph. Centrality, community, and similarity analyses were executed on the graph. As a result, critical and influential APT groups and indicators of compromise (IoC) were discovered. Similar attacks and APT groups were revealed. Analysis results were interpreted to create new strategic CTI that can be utilized in future security operations.Keywords
All Related Versions
This publication has 72 references indexed in Scilit:
- Research on node influence in complex network based on multi-scale centrality algorithmProcedia Computer Science, 2023
- The Rise of GoodFATR: A Novel Accuracy Comparison Methodology for Indicator Extraction ToolsFuture Generation Computer Systems, 2023
- CBLA: A Clique Based Louvain Algorithm for Detecting Overlapping CommunityProcedia Computer Science, 2023
- A review of threat modelling approaches for APT-style attacksHeliyon, 2021
- From Louvain to Leiden: guaranteeing well-connected communitiesScientific Reports, 2019
- Eigenvector centrality for characterization of protein allosteric pathwaysProceedings of the National Academy of Sciences, 2018
- Mathematics of Networks2008
- A Graph-theoretic perspective on centralitySocial Networks, 2006
- Friends and neighbors on the WebSocial Networks, 2003
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001