Skip to content

Attack Chain Reconstruction Method Based on LLM Prior-Knowledge Guidance and Heterogeneous Graph Reasoning

Sep 2026 · Electronics · Vol 15, pp. 4348 · 0 citations · 17 references
Advanced Graph Neural Networks

TL;DR

This paper proposes a heterogeneous graph attack chain reconstruction method based on LLM prior-knowledge guidance that verifies the effectiveness of the cooperation between semantic understanding and structural reasoning.

Abstract

In the face of multi-stage and cross-device complex network attacks, reconstructing the complete attack link from massive heterogeneous security logs is the core problem of security operation. In the existing methods, the traditional graph model lacks a deep understanding of the semantics of alerts, and large language models (LLMs) have the ability of textual reasoning, but have difficulty effectively using the topology between entities, and have difficulty uniformly representing and globally relating multi-source heterogeneous data. Aiming at the above problems, this paper proposes a heterogeneous graph attack chain reconstruction method based on LLM prior-knowledge guidance. Firstly, ontology schemas of six types of core security entities and four types of relationship types are designed for multi-source security logs, and a unified heterogeneous graph representation is constructed by integrating temporal association, spatial association and semantic association. Events scattered in different devices and time windows are correlated into structured views. Secondly, the domain-adaptive fine-tuned LLM is used to encode the deep semantics of the node attribute text, and it is fused with the structural features to make up for the shortcomings of traditional graph neural networks that only rely on shallow statistical features. On this basis, a heterogeneous graph attention mechanism guided by LLM prior knowledge is designed, the attention weight is modulated by the LLM’s semantic score of edge rationality, and candidate attack links are generated by multi-step path reasoning along high-confidence edges. Finally, the logical verification and attack confirmation of the candidate link were carried out step by step with the help of the chain-of-thought ability of LLM, and the confidence was calibrated by temperature scaling. Experiments on DARPA TC and other datasets show that the integrity rate of attack link reconstruction is 86.4%, the coverage rate of attack phase is 82.1%, and the F1 value of attack confirmation is 90.6%, which is significantly better than the methods based on a probabilistic graph model, Heterogeneous Graph Transformer and pure LLM hint engineering. This verifies the effectiveness of the cooperation between semantic understanding and structural reasoning.

Read PDF

Similar papers

Conference Sep 2026

Research on attack knowledge graph construction and APT attack chain intelligent reconstruction system oriented to massive data

Advanced Persistent Threat (APT) is featured by organized operations, long-term latency, strong concealment, and continuous evolution of tactics and techniques. It has become the core cybersecurity threat faced by national critical information infrastructure, energy and financial industries, as well as large government...

Peng-Bin Tian · 0 citations
2026

R3S: Attack-Mitigation Reasoning in Security Knowledge Graphs

In recent years, threat intelligence analysis based on knowledge graphs has been widely regarded as a key approach to achieving proactive defense. However, existing research still suffers from deficiencies in timeliness and comprehensiveness when it comes to supplementing malicious vulnerabilities, mitigation measures,...

Ze-Qing Li, Cheng Huang, Jia-Ren Peng et al. · 0 citations
Conference Aug 2026

MRR-VD: Multi-stage Retrieval-Augmented Reasoning for Smart Contract Vulnerability Detection

The rapid advancement of Web 3.0 and blockchain technologies has made smart contract security a fundamental requirement for the reliable operation of blockchain systems. Recently, methods based on large language models (LLMs) combined with Retrieval-Augmented Generation (RAG) have been applied to smart contract vulnera...

Hui Tan, Xing-Yu Wang, Zi-Hui Deng et al. · 0 citations
Preprint Sep 2026

Construction and Natural Language Querying of a Cybersecurity Knowledge Graph

Cybersecurity vulnerability information is distributed across numerous platforms and databases, making it difficult for researchers and practitioners to obtain a unified and structured understanding of existing threats. This is a critical issue in cybersecurity, where timely access to accurate vulnerability information...

Ines Ben Brahim, Mohamed-Amine El Mortaji, Nadav Haddad et al. · 0 citations
Conference Aug 2026

Structure-guided Multi-branch Graph Fusion for Smart Contract Vulnerability Detection

Smart contract vulnerability detection is essential for ensuring the security and reliability of blockchain applications. Existing program analysis methods rely heavily on handcrafted rules and often generalize poorly to contracts with complex control flow, whereas many learning-based methods depend on a single graph r...

Yuxuan Tai, He-Mu Li, Dong-Wu Dai et al. · 0 citations
Conference Aug 2026

Enhancing Security of Cross-Chain Bridge Smart Contracts Using Multi-Model Deep Learning Techniques for Vulnerability Detection

One of the key elements facilitating cross-chain bridges is the ability to connect assets and data from different chains, irrespective of their incompatibility. They provide significant functionality with their multi-chain logic, but also add some complexity to the security problems, as several bridge smart contract ha...

Deepa Mishra, Shraddha P. Phansalkar · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.