Extracting Chinese Cyber Threat Intelligence (CTI) under increasingly complex advanced persistent threat scenarios is crucial, yet challenging due to domain-specific term ambiguity and frequent long, nested entities. To address polysemy, nested-label conflicts, and cross-sentence semantic discontinuity, we propose an enhanced Transformer-based entity recognition method formulated as a pointer network. On the encoder side, we build a RoBERTa model with Rotary Positional Embeddings. To handle complex positions and boundaries of heterogeneous entity types, we introduce tokenization compensation and positional-parameter compression to sharpen boundary sensitivity. In the decoder, we refine GlobalPointer and model recognition as 2D head–tail span matching, enabling direct detection of overlapping and nested entities. To mitigate long-tail bias, we introduce an entity-frequency-aware dynamic threshold and a reweighted zero-boundary log-loss to improve recall for rare entities. Experiments demonstrate an overall F1 improvement of 6.32% over baselines on Chinese CTI datasets, with absolute gains reaching 19.7% specifically on nested and long entities. These results validate the model’s effectiveness in Chinese-specific named entity recognition and its utility for high-accuracy automated CTI analysis.
Retrieval-augmented generation (RAG) substantially improves large language models (LLMs) on knowledge-intensive tasks by incorporating external knowledge, yet open knowledge sources introduce prominent security risks. The SafeRAG benchmark identifies four novel textual evidence manipulation attacks, namely silver noise, inter-context conflict, soft advertisement, and White Denial-of-Service (White DoS), which bypass conventional defense components and threaten both the security and availability of RAG systems. Existing single-stage defenses fail to capture the implicit malicious characteristics of these attacks, while multi-stage frameworks are limited by fixed parameters, weak conflict resolution, and insufficient detection of implicit toxicity and availability threats. To address these limitations, we propose MIRAGE, a two-stage adaptive defense framework combining retrieval-side purification and generation-side resolution. The first stage applies attack-characteristic-aware dynamic K-means clustering and dynamic ROUGE-L threshold filtering to eliminate malicious documents. The second stage employs attack-adaptive knowledge integration rules alongside an enhanced self-evaluation mechanism that jointly verifies factual accuracy, implicit toxicity, and availability. Under the static, non-adaptive attack setting defined by SafeRAG, experiments on DeepSeek-v3.2 show that MIRAGE achieves average improvements of 20.9% in Attack Failure Rate (AFR), 11.5% in Retrieval Accuracy (RA), and 14.1% in F1(avg) over baselines across all four attack scenarios, providing effective technical support for the stable deployment of RAG systems in complex adversarial environments.
Most existing log parsers are static. When parsing logs with a static parser, the accuracy tends to fluctuate significantly. To overcome this issue, this paper proposes a dynamic log parser named DLogParser. The core idea of DLogParser is to select different parsing policies based on log features. DLogParser first parses a small batch of sample log messages, then analyzes log characteristics from the parsing results, and determines an appropriate parsing policy for the current logs. Then it parses all remaining logs according to the determined policy. To support dynamic parsing policies, DLogParser incorporates 5 grouping criteria for log features, including length, punctuation, first token, last token, and key token, and establishes 7 rules for parsing policy generation. We evaluated DLogParser on public datasets from LogHub. The experimental results demonstrate that compared to 11 existing log parsers, DLogParser achieves an accuracy of 90.3% with an acceptable performance loss.
Path planning constitutes a critical component of penetration testing for 5G-ICPS networks. The diversity of interfaces and protocols necessitates deep analysis of vulnerability exploitation methods and cross-protocol combination strategies, significantly increasing attack path planning complexity. Furthermore, dynamic network slice configurations and physical-information coupling effects drive continuous topological evolution, causing state-space explosion and challenging path planning under uncertainty with incomplete information. To address these issues, we construct a temporal attack graph modeling 5G-ICPS attack processes, and design a GraphSAGE-based environment representation encoder. This encoder undergoes multi-tiered self-supervised pre-training, employing node-level and graph-level training to encode diverse reinforcement learning environments across attack scenarios into fixed-dimensional vector representations. This achieves decoupling from underlying topology, vulnerability specifics, and security configurations, effectively mitigating state-space explosion in large-scale networks. Subsequently, we cluster highly similar vulnerabilities and filter invalid attack actions using three typical 5G-ICPS attack constraints, compressing the agent’s exploration space. Especially, we design a customized reward function that dynamically incentivizes/penalizes actions based on compromised assets. Experimental results demonstrate significant improvements: penetration testing invalid action rates decrease from 22.3% to 7.5%, while average steps to achieve attack targets reduce by >54%. These advancements effectively reduce penetration testing costs and increase attack success rates.