Alert-driven Attack Graph Generation using S-PDFA
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Ideal cyber threat intelligence (CTI) includes insights into attacker strategies that are specific to a network under observation. Such CTI currently requires extensive expert input for obtaining, assessing, and correlating system vulnerabilities into a graphical representation, often referred to as an attack graph (AG). Instead of deriving AGs based on system vulnerabilities, this work advocates the direct use of intrusion alerts. We propose SAGE, an explainable sequence learning pipeline that automatically constructs AGs from intrusion alerts without a priori expert knowledge. SAGE exploits the temporal and probabilistic dependence between alerts in a suffix-based probabilistic deterministic finite automaton (S-PDFA)-a model that brings infrequent severe alerts into the spotlight and summarizes paths leading to them. Attack graphs are extracted from the model on a per-victim, per-objective basis. SAGE is thoroughly evaluated on three open-source intrusion alert datasets collected through security testing competitions in order to analyze distributed multi-stage attacks. SAGE compresses over 330k alerts into 93 AGs that show how specific attacks transpired. The AGs are succinct, interpretable, and provide directly relevant insights into strategic differences and fingerprintable paths. They even show that attackers tend to follow shorter paths after they have discovered a longer one in 84.5% of the cases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)
Adadi, A., & Berrada, M. (2018) · IEEE Access · doi:10.1109/access.2018.2870052 · Cited by 6,294
Explainable machine learning for scientific insights and discoveries
Roscher, R., Bohn, B., Duarte, M. F., & Garcke, J. (2020) · IEEE Access · doi:10.1109/access.2020.2976199 · Cited by 1,040 · cited 1×
“These notions are described by Roscher et al. [46], who list the three components of explainable machine learning as: transparency , interpretability , and explainability .”
BackgroundAttention Models in Graphs: A Survey
Lee, J. B., Rossi, R. A., Kim, S., Ahmed, N. K., & Koh, E. (2018) · arXiv · doi:10.48550/arxiv.1807.07984 · Cited by 59
Cited by
Artificial intelligence for cybersecurity: Literature review and future research directions
Kaur, R., Gabrijelčič, D., & Klobučar, T. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.101804 · Cited by 615
Cyber Threat Intelligence Mining for Proactive Cybersecurity Defense: A Survey and New Perspectives
Sun, N., Ding, M., Jiang, J., Xu, W., Mo, X., Tai, Y., & Zhang, J. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3273282 · Cited by 301
The Role of Machine Learning in Cybersecurity
Apruzzese, G., Laskov, P., Montes de Oca, E., Mallouli, W., Brdalo Rapa, L., Grammatopoulos, A. V., & Di Franco, F. (2023) · Digital Threats: Research and Practice · doi:10.1145/3545574 · Cited by 279
Xiao, F., Chen, S., Yang, J., He, H., Jiang, X., Tan, X., & Jin, D. (2025) · Computers & Security · doi:10.1016/j.cose.2024.104180 · Cited by 17
TRACE: Relationship Analysis and Causal Factor Extraction in Cyber Threat Intelligence Reports
Vaitheeshwari, R., Wu, E. H.-K., Lin, Y.-D., Hwang, R.-H., Lin, P.-C., Lai, Y.-C., & Ali, A. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3532885 · Cited by 12
“Furthermore, approaches such as the extraction of TTPs, threat actions, Indicators of Compromises (IoCs) [3], [4], [5], [6] and knowledge graph-based works [7], [8], [9], [10], [11], [12], [13], [14] have been developed to facilitate the analysis of CTI data.”
Metadata
- Authors
- Nadeem, A., Verwer, S., Moskal, S., & Yang, S. J.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2021
- Pages
- 1-1
- ISSN
- 1545-5971 (ISSN-L)
- 1941-0018
- 2160-9209
- OpenAlex
- W3201894803
- Cited by
- 49
- References
- 3
- FWCI
- 3.93
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Alert-driven Attack Graph Generation using S-PDFA. https://app.cochat.ai/papers/10.1109/tdsc.2021.3117348
- The paper
- Nadeem, A., Verwer, S., Moskal, S., & Yang, S. J. (2021). Alert-driven Attack Graph Generation using S-PDFA. IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.2021.3117348
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.