Cited by 16Network Security and Intrusion DetectionInformation and Cyber SecurityAdversarial Robustness in Machine Learning

Slot : Provenance-Driven APT Detection through Graph Reinforcement Learning

Open access
Qiao, Wei, Feng, Yebo, Li, Teng, Ma, Zhuo, Shen, Yulong, Ma, Jianfeng, Liu, Yang·2025·Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security

Abstract

Advanced Persistent Threats (APTs) represent sophisticated cyberattacks characterized by their ability to remain undetected within the victim system for extended periods, aiming to exfiltrate sensitive data or disrupt operations. Existing detection approaches often struggle to effectively identify these complex threats, construct the attack chain for defense facilitation, or resist adversarial attacks. To overcome these challenges, we propose Slot, an advanced APT detection approach based on provenance graphs and graph reinforcement learning. Slot excels in uncovering multi-level hidden relationships, such as causal, contextual, and indirect connections, among system behaviors through provenance graph mining. Slot implements semi-supervised learning with limited labels through efficient label similarity computation, significantly enhancing both detection performance and model robustness. By pioneering the integration of graph reinforcement learning, Slot dynamically adapts to new user activities and evolving attack strategies, enhancing its resilience against adversarial attacks. Additionally, Slot automatically constructs the attack chain according to detected attacks with clustering algorithms, providing precise identification of attack paths and facilitating the development of defense strategies. Evaluations with real-world datasets demonstrate Slot's outstanding accuracy, efficiency, adaptability, and robustness in APT detection, with most metrics surpassing state-of-the-art methods. Additionally, case studies conducted to assess Slot's effectiveness in supporting APT defense further establish it as a practical and reliable tool for cybersecurity protection.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3719027.3744788

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Authors
Qiao, W., Feng, Y., Li, T., Ma, Z., Shen, Y., Ma, J., & Liu, Y.
Affiliations
  • Xidian University (CN)
  • Nanyang Technological University (SG)
Venue
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security
Publisher
ACM
Published
2025-11-19
Pages
963-977
ISSN
1543-7221 (ISSN-L)
OpenAlex
W4416549596
Cited by
16
References
1
Citations by year
2026: 15 · 2025: 1
FWCI
16.84
Type
conference paper
Language
en
Open access
Licence
cc-by-nc-sa
Locations
  • ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion)
  • DR-NTU (Nanyang Technological University) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by-nc-sa)
  • arXiv (Cornell University)
Funders
  • National Key Research and Development Program of China (2023YFB2904000)
  • Natural Science Basic Research Program of Shaanxi (2025JC-JCQN-073)
  • National Natural Science Foundation of China under Grant (62272370)
  • Young Elite Scientists Sponsorship Program by CAST (2022QNRC001)
  • China 111Project (B16037)
  • Qinchuangyuan Scientist + Engineer Team Program of Shaanxi (2024QCY-KXJ-149)
  • Songshan Laboratory (241110210200)
  • Open Foundation of Key Laboratory of Cyberspace Security, Ministry of Education of China (KLCS20240405)
  • Fundamental Research Funds for the Central Universities (QTZX23071)
  • National Research Foundation, Singapore, and DSO National Laboratories under the AI Singapore Programme (AISG2-GC-2023-008)
  • National Research Foundation, Singapore, and the Cyber Security Agency under its National Cybersecurity R&D Programme (NCRP25-P04-TAICeN)
  • National Research Foundation, Prime Minister?s Office, Singapore under its Campus for Research Excellence and Technological Enterprise (CREATE) programme
  • Ripple under its University Blockchain Research Initiative (UBRI)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
  • Physical Sciences › Computer Science › Information Systems › Information and Cyber Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
advanced persistent threats, APT detection, provenance graphs, graph reinforcement learning, adversarial robustness, semi-supervised learning, label similarity, user behavior analysis, cyber defense

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