Loading...

Table of Content

    10 July 2026, Volume 26 Issue 7 Previous Issue    Next Issue

    For Selected: Toggle Thumbnails
    A selective aggregation lightweight backdoor defense method for distributed fine-tuning of large models
    Lyu Xinchen, Yin Shimin
    2026, 26 (7):  1001-1011.  doi: 10.3969/j.issn.1671-1122.2026.07.001
    Abstract ( 132 )   HTML ( 16 )   PDF (13778KB) ( 63 )  

    Low-rank adaptation (LoRA) fine-tuning freezes pretrained weights and only optimizes low-rank factor matrices, enabling efficient collaborative training of large models in distributed settings while substantially reducing communication and computation costs. As a result, LoRA has become a key technique for enabling secure data utilization for large-model training. However, the low-rank update mechanism of LoRA allows attackers to target specific subspaces, making distributed LoRA fine-tuning more vulnerable to backdoor attacks. Existing backdoor defenses methods typically rely on complex outlier detection, statistical filtering, or centralized supervision, which introduce significant additional computation and communication overhead and are therefore ill-suited to resource-constrained distributed fine-tuning of large models. To address this challenge, this paper proposed selective aggregation low-rank adaptation (SA-LoRA), a lightweight backdoor defense method that selectively aggregates only the low-rank matrix B during training while keeping matrix A local to each client. This asymmetric protocol drives benign clients to form an approximately null subspace for backdoor features, thereby suppressing backdoor propagation without introducing extra overhead. Experiments on multiple open-source large models under diverse backdoor attack methods, including word-level triggers and synonym-substitution attacks, show that SA-LoRA reduces the backdoor attack success rate on benign clients from 96.93% to 11.53%, while incurring only about a 1% drop in main-task performance and requiring no additional computation or communication resources, achieving a favorable trade-off between security and efficiency.

    Figures and Tables | References | Related Articles | Metrics
    Software defect prediction method based on multi-view pruning and optimized random forest
    Zhang Dawei, Zhou Yang, Du Ye, Tang Yu
    2026, 26 (7):  1012-1027.  doi: 10.3969/j.issn.1671-1122.2026.07.002
    Abstract ( 74 )   HTML ( 12 )   PDF (17276KB) ( 28 )  

    Aiming at the problems that traditional random forests applied in the field of software defect prediction suffer from high structural redundancy, poor interpretability, and limited prediction performance caused by the separation of parameter optimization and structural pruning, this paper proposed an optimized random forest model (POMRF) integrating a multi-view structural redundancy pruning mechanism (MSRP) and an improved sparrow search algorithm (SCSSA). Firstly, a multi-view redundancy evaluation system was constructed, which fused semantic similarity and structural distance through feature usage vectors and weighted structural vectors to accurately identify and eliminate redundant decision trees; Secondly, the Sparrow Search Algorithm was improved by introducing a sine cooperative update mechanism and a hybrid mutation strategy to optimize the core parameters of the random forest, thereby enhancing the global optimization capability and robustness of the algorithm; Finally, the POMRF model was applied to software defect prediction tasks, and experimental verification was carried out on 6 public software defect datasets in comparison with various state-of-the-art algorithms. The experimental results show that the POMRF model outperforms other comparison algorithms in multiple evaluation metrics. It not only effectively solves the problem of inaccurate single-view redundancy evaluation of traditional methods, improves the interpretability and structural compactness of the model, but also breaks through the limitation of the separation between parameter optimization and pruning through their collaborative linkage, significantly enhancing the prediction accuracy and stability. This model provide an efficient and reliable solution that balanced accuracy and interpretability for the field of software defect prediction.

    Figures and Tables | References | Related Articles | Metrics
    Enhancing malware detection via multi-view sensitivity mining and Sens-FiLM modulation
    Kou Liang, Tu Guoxuan, Pan Xiaochen, Zhang Jilin
    2026, 26 (7):  1028-1043.  doi: 10.3969/j.issn.1671-1122.2026.07.003
    Abstract ( 80 )   HTML ( 10 )   PDF (19044KB) ( 38 )  

    Leveraging contextual semantics in API sequences is effective for malware detection, yet the security semantics of run-time parameters remain underexplored. Although recent studies attempt to incorporate run-time parameters via static labeling, they often fail to capture the dynamic semantic ambiguity where risk varies by API context and often fail to detect individual anomalies that evade cluster-based patterns. This paper proposed MvSe-Mal, a multi-view sensitivity mining framework for malware detection. The framework first employed statistical risk analysis to quantify the intrinsic security level of API operations. Then, it established a three-dimensional sensitivity quantification mechanism by integrating complementary mining strategies: cluster analysis to capture grouped malicious behaviors, individual anomaly detection to pinpoint statistical irregularities, and API affinity to measure the associative strength between parameters and malicious API. Finally, it proposed a sensitivity-aware feature-wise linear modulation (Sens-FiLM) mechanism. Instead of simple static concatenation, Sens-FiLM treated sensitivity levels as dynamic conditions to recalibrate the intermediate feature representations of deep neural networks. This enabled the model to adaptively highlight high-risk behavioral patterns while suppressing noise based on real-time sensitivity contexts. The framework were evaluated on two DNN models. Extensive experiments demonstrate that MvSe-Mal significantly outperformed not only baselines relying solely on API sequences but also existing approaches that incorporate parameters, validating the effectiveness of the proposed strategy.

    Figures and Tables | References | Related Articles | Metrics
    A semi-byte second-order Markov chain and convolution-enhanced Transformer-based method for encrypted traffic classification
    Feng Jingyu, Luo Chen, Yang Shuaiyi, Fan Yu
    2026, 26 (7):  1044-1057.  doi: 10.3969/j.issn.1671-1122.2026.07.004
    Abstract ( 70 )   HTML ( 6 )   PDF (15430KB) ( 21 )  

    To address the limitations in feature representation and insufficient modeling of deep temporal dependencies in encrypted traffic classification, as well as the inadequate integration of convolutional neural networks and Transformer architectures, this paper proposed NSOM-CF, an encrypted traffic classification method that combines a semi-byte second-order Markov chain with a convolution-enhanced Transformer (ConvFormer). By modeling the original traffic byte sequences at the semi-byte level, NSOM-CF constructed a second-order Markov transition probability matrix that reflected byte transition patterns, effectively alleviating matrix sparsity while preserving the dynamic variations and temporal dependencies of traffic. By further mapping the transition matrix into multi-channel feature maps, NSOM-CF leveraged ConvFormer to capture both local spatial features and global contextual dependencies, generating vector representations of the feature maps to achieve accurate encrypted traffic classification. Experimental results show that the proposed method achieves accuracies of 0.9967 and 0.9968 on the ISCX-VPN and USTC-TFC datasets, respectively, demonstrating the effectiveness of NSOM-CF in encrypted traffic classification tasks.

    Figures and Tables | References | Related Articles | Metrics
    A review of generative image steganography: methods, robustness challenges and prospects
    Gong Changwei, Jin Bo, Yuan Deyu, Zhang Xuan
    2026, 26 (7):  1058-1076.  doi: 10.3969/j.issn.1671-1122.2026.07.005
    Abstract ( 92 )   HTML ( 10 )   PDF (24284KB) ( 32 )  

    Generative image steganography (GIS) embeds secret information into the image generation process, providing a new path different from the traditional carrier modification paradigm. However, the research on this technical method is still challenged by robustness issues. Especially in online social network (OSN), processing such as recompression, format conversion, and multiple rounds of re-encoding can undermine the stability of hidden signals and generated inversion, and intensify the conflict between robustness and capacity-security performance. This paper focused on the main line of robustness and conducted a systematic review of current GIS methods. Firstly, it sorted out the generative steganography methods based on three different technical routes and their recent progress. Subsequently, analyzed the robustness challenges of OSN in lossy channels. Then summarized the robustness evaluation indicators, OSN channel modeling and other experimental evaluation norms. Finally, the future research directions of robust GIS were prospected from multiple aspects such as distorted channel modeling and robust latent space mapping, aiming to deepen the systematic understanding of the robustness problem of GIS in OSN channels and promote related frontier research and applications.

    Figures and Tables | References | Related Articles | Metrics
    Interactive convolution and Transformer based anomaly detection algorithm
    Zheng Tianming, Liu Shangdong, Li Haitian, Li Hua
    2026, 26 (7):  1077-1086.  doi: 10.3969/j.issn.1671-1122.2026.07.006
    Abstract ( 68 )   HTML ( 9 )   PDF (10790KB) ( 20 )  

    To address the limitations of the Transformer model’s attention mechanism in handling the inherent noise and redundant information in time series data, this paper proposed an anomaly detection algorithm based on interactive convolution and Transformer, termed ICT-AD. The algorithm employed an adaptive frequency filter (AFF) to remove high-frequency noise and redundant information, and adopted Anomaly Transformer as its backbone network. Additionally, an adaptive interactive convolution (AIC) block was introduced to further enhance the model’s ability to capture and interpret complex temporal patterns. Extensive experimental results on four datasets demonstrate that ICT-AD outperforms existing methods.

    Figures and Tables | References | Related Articles | Metrics
    An LLM-assisted firmware memory leak analysis based on instruction translation instrumentation
    Yao Wuhuang, Wang Jiapeng, Chen Kangbing, Zheng Zhihan, Tan Yu’an
    2026, 26 (7):  1087-1100.  doi: 10.3969/j.issn.1671-1122.2026.07.007
    Abstract ( 60 )   HTML ( 7 )   PDF (16441KB) ( 15 )  

    With the widespread deployment of embedded devices in various critical scenarios, memory leaks in Linux-based embedded firmware can degrade service availability and even cause service failures. Existing memory leak detection methods for open-source firmware rely on source code and symbol information, making it difficult to directly extend to closed-source firmware; while automated memory leak detection methods for closed-source firmware suffer from insufficient support for ARM architecture firmware. Therefore, we proposed a memory leak analysis method for Linux-based closed-source firmware, MemLeakFinder. Based on QEMU’s intermediate code instruction translation and instrumentation technology, it achieved dynamic tracking and analysis of the target program’s memory operations. It combined fuzzing and disassembly analysis techniques to locate potential memory leak vulnerabilities and introduced a large language model (LLM) to perform semantic understanding and automated root cause analysis of the captured memory leak vulnerability scenarios. We selected BMC firmware as the target environment and CGI as the target protocol, and conducted comprehensive experiments. Experimental results show that MemLeakFinder achieves an accuracy rate of 92.16% in the Juliet test suite. In tests on 7 real BMC firmwares, MemLeakFinder successfully discovered and verified 5 actual vulnerabilities. One critical vulnerability has been assigned a CVE number. These results, verifying the effectiveness of this method in memory security analysis of closed-source firmware programs.

    Figures and Tables | References | Related Articles | Metrics
    Anomaly detection system for computing power networks based on behavioral attention
    Qian Xiaosheng, Wang Liying, Zhao Yu, Liu Guangya, Wang Cheng
    2026, 26 (7):  1101-1114.  doi: 10.3969/j.issn.1671-1122.2026.07.008
    Abstract ( 71 )   HTML ( 8 )   PDF (18444KB) ( 20 )  

    As a new-generation information infrastructure, the efficient and stable operation of computing power networks serves as a critical cornerstone for ensuring the security of the national digital economy and the resilience of key information infrastructure. With the continuous growth in computing power demand and the increasing scale and complexity of tasks, accurate prediction of task demands is not only a prerequisite for optimal allocation of computing resources but also a key means of identifying abnormal resource usage and potential attack behaviors. However, existing methods often struggle to capture local sudden fluctuations and complex dynamic patterns across multiple task types when processing long-sequence task demands, leading to reduced resource scheduling efficiency and issues such as missed detections and false alarms for anomalous demands. To address these challenges, this paper designed and implemented an anomalous task demand detection system for computing power networks. The system introduced a behavior-enhanced attention mechanism that, by integrating multi-scale statistical measures with sliding window analysis, dynamically captures task attributes and temporal behavioral features, thereby significantly improving the identification and prediction of sudden patterns. Through precise sensing of demand surge behaviors in the network, the system helped detect potential precursors of anomalous traffic attacks in advance, providing decision support for secure scheduling of computing resources and system protection. Experimental results on the Alibaba Cluster Traces dataset demonstrate that the behavior-enhanced attention mechanism integrated into the system achieves optimal performance in terms of both mean squared error (MSE) and mean absolute error (MAE), significantly outperforming existing methods in perception accuracy for complex task fluctuations. In summary, the proposed system not only improves the accuracy and robustness of task demand prediction in computing power networks but also enhances the perception of potential risks.

    Figures and Tables | References | Related Articles | Metrics
    Multi-path feature enhanced deep learning method for rectangule attack and defense
    Sun Haoran, Chen Jie, Liu Jun
    2026, 26 (7):  1115-1127.  doi: 10.3969/j.issn.1671-1122.2026.07.009
    Abstract ( 49 )   HTML ( 5 )   PDF (14100KB) ( 8 )  

    To address the issues of single input features and limited capability in identifying cryptographic characteristics when combining traditional rectangle attacks with deep learning, this paper proposed an extended rectangle neural differential distinguisher model, taking the SPECK32/64 algorithm and its variant SPECKEY as the research objects. By constructing ciphertext data groups with triple constraints, the model expanded the unidirectional differential propagation path into multi-path feature inputs, thereby enhancing the neural network’s ability to capture non-random statistical characteristics of high-round ciphers. Experimental results show that the distinguishers for 5 to 8-round SPECK32/64 and 6 to 8-round SPECKEY construct based on this model all outperform the traditional rectangle neural distinguisher in classification accuracy. Furthermore, using the trained 8-round extended rectangle neural differential distinguisher, a subkey recovery attack is performed on the 10-round SPECK32/64 algorithm. The attack results show that while the complete recovery rate for the full 16-bit subkey is 12%, the model achieves a 100% prediction accuracy on the remaining 14 bits after eliminating the influence of two insensitive bits. This study demonstrates the effectiveness of incorporating multi-path feature inputs, providing a more effective analytical model for the application of deep learning in the field of cryptanalysis.

    Figures and Tables | References | Related Articles | Metrics
    LLM-based semantic-aware fuzz driver generation
    Yang Qiaoyang, Fan Ximing, Jia Peng
    2026, 26 (7):  1128-1148.  doi: 10.3969/j.issn.1671-1122.2026.07.010
    Abstract ( 62 )   HTML ( 4 )   PDF (25867KB) ( 11 )  

    Fuzz testing is regarded as one of the key technologies and major research hotspots in the field of software vulnerability discovery. Writing high-quality fuzz testing drivers has long been a difficult and error-prone task. It is not only time-consuming and labor-intensive, but also requires developers to possess a deep understanding of the target library. Traditional automated fuzz driver generation approaches attempt to extract data-flow and control-flow dependencies among API from client code in different ways, but they fail to capture the complex usage-pattern constraints of some API, resulting in low coverage and frequent API misuse. With the rise of large language models, many LLM-based fuzz driver generation approaches have recently emerged. However, their prompt construction is typically centered only on functions and related types, lacking semantic elements associated with the target project and thus underutilizing the semantic reasoning capabilities of LLM. To address these challenges, this paper proposed StageFuzz, a fuzz driver generation approach that incorporated both semantic and syntactic library elements. StageFuzz heuristically queried the LLM to obtain two types of semantic elements, namely library pipelines and semantic stages. It then performed three levels of driver generation and mutation based on pipelines, semantic stages, and API, together with existing fuzz drivers, in order to improve driver quality and reduce generation time. This paper evaluats StageFuzz on eight open-source libraries. Experimental results show that, compared with the current state-of-the-art tool, StageFuzz achieves a 10.40% coverage improvement while consuming only 12.73% of the LLM tokens and 1.79% of the generation time.

    Figures and Tables | References | Related Articles | Metrics
    Federated unlearning via knowledge distillation and adversarial examples
    Song Mengyuan, Xia Hui
    2026, 26 (7):  1149-1163.  doi: 10.3969/j.issn.1671-1122.2026.07.011
    Abstract ( 47 )   HTML ( 7 )   PDF (16672KB) ( 7 )  

    With the rapid advancement of artificial intelligence, federated learning has been widely adopted in multiple sensitive domains such as healthcare and finance. However, amid growing demands for privacy protection, how to efficiently remove sensitive information from models while preserving data privacy remains a challenging task. To address this issue, this paper proposed a federated unlearning method that combines knowledge distillation with adversarial examples, aiming to balance model utility and privacy while minimizing the time overhead of the unlearning process. To validate the effectiveness of the proposed method, we designed two application scenarios and conducted comparative experiments using four datasets and six mainstream baseline methods. Experimental results demonstrate that the proposed method achieves a favorable trade-off among model usability, privacy, and runtime efficiency. On the CIFAR-10 and SVHN datasets, compared with the six baseline methods, our approach significantly improves privacy protection and runtime efficiency while maintaining model usability at a comparable level.

    Figures and Tables | References | Related Articles | Metrics