TGL-APT effectively balances detection performance, computational efficiency, and investigation capability for provenance-based APT analysis, and is demonstrated to reduce training time, detection latency, and memory usage compared with KAIROS.
Abstract
Advanced Persistent Threat (APT) attacks pose a critical challenge to modern systems, as their stealthy, multi-stage nature renders conventional detection methods ineffective. While provenance graphs provide rich behavioral context for attack investigation, attack-relevant evidence is often sparse and embedded in large volumes of routine system activity, making full-graph learning both computationally expensive and difficult to correlate over long attack sequences. We present TGL-APT, an adaptive investigation framework built on the observation that attack-relevant information is non-uniformly distributed and often mediated by structurally influential or behaviorally distinctive entities, which we characterize as information-bottleneck nodes. TGL-APT combines three complementary components: (1) information-bottleneck-guided graph distillation that suppresses provenance redundancy while bounding structural distortion and preserving causal reachability; (2) adaptive temporal graph learning that continuously refines the core node set as node relevance evolves; and (3) cross-spatiotemporal attack fingerprint alignment that associates fragmented suspicious activities across different entities and time windows. Finally, causal expansion and stage characterization reconstruct coherent attack processes for investigation. Experiments on three DARPA E3 datasets show F1-scores of 95.7%, 90.9%, and 88.9%, while reducing training time, detection latency, and memory usage by approximately 39%, 33%, and 22%, respectively, compared with KAIROS. These results demonstrate that TGL-APT effectively balances detection performance, computational efficiency, and investigation capability for provenance-based APT analysis.
A novel transferable graph prompt attack, called TGPA, is proposed, which shifts the attack paradigm by introducing a hierarchical structural decoupling mechanism, which reduces the performance of pre-trained graph models with graph prompts by up to 28.9%, while guaranteeing robustness, stealthiness, and transferabilit...
Ju Jia, Haonan Wang, Tian Wu et al.· Neural Networks· 0 citations
SAGA (Synthetic Agentic Graph Architecture), a system for generating large-scale, semantically rich temporal graphs via a four-phase pipeline, achieves structural realism, semantic richness, and automatic anomaly labeling in a unified framework.
Dynamic graph anomaly detection (DGAD) is critical for a wide range of applications where abnormal events are rare, evolving, and tightly coupled with temporal context. Despite rapid progress in modeling dynamic graphs, the evaluation of DGAD methods remains fragmented, leaving the strengths, limitations, and trade-off...
Mohamed Nazim Mezhoudi, Guillaume Lachaud, Yanlei Diao et al.· Proceedings of the 32nd ACM...· 0 citations
BEACON is an LLM-driven framework for cross-source CTI knowledge graph construction that constructs and releases two human-annotated datasets from 34 sources and outperforms all baselines by at least 23% and 9%, respectively.
CAPG-v2 is introduced: a lightweight extension that adds probabilistic semantics and goal impact annotations, enabling impact-weighted and overlap-aware prioritization of patch prioritization, and formalizes a path-based score that aggregates across distinct goal-reaching paths.
Noufal Issa, Damas P. Gruska, Loubna Ali· International Conference on...· 0 citations
Experimental results show that LLMs, when guided by rubric-based prompts and supplemented with ATT&CK domain knowledge, achieve robust performance across detection, localization, and TTP mapping tasks.
Joon-Young Gwak, Aubrey Strier, Zhaohan Xi et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.