Latest ArticlesTo address resource constraints of terminal devices, distributed cross-domain trust, and dynamic access policies in large-scale Internet of things (IoT) environments, we propose a lightweight access control mechanism based on blockchain and fog computing. The mechanism adopts a layered architecture of on-chain trusted state maintenance, fog-side real-time authorization, and terminal-side lightweight identity response. High-complexity operations in attribute-based encryption (ABE), including key generation, policy matching, encryption, and decryption, are offloaded to fog nodes, while terminals only perform physical unclonable function (PUF) response generation and SHA-256 hashing. To support fine-grained and trusted cross-domain access, a hybrid authorization framework combining ciphertext-policy ABE (CP-ABE) and key-policy ABE (KP-ABE) is designed, where CP-ABE expresses resource-level access policies and KP-ABE supplements user-level resource permissions. Device identity hashes, policy states, and revocation events are recorded on a Hyperledger Fabric consortium blockchain, forming a trusted identity chain that combines PUF-based physical uniqueness with on-chain state consistency. In addition, a short-lived cross-domain access token and a challenge-hash-based verification method are introduced for cross-domain authentication and lightweight outsourced decryption verification. Security analysis shows that the mechanism satisfies identity authentication, session establishment, data confidentiality, collusion resistance, replay resistance, and unforgeability of cross-domain credentials. Prototype experiments show that, with five attributes, CP-ABE encryption and decryption take approximately 13.3 ms and 5.5 ms, respectively, and the data access path latency is approximately 18 ms. The results demonstrate that the proposed mechanism can support fine-grained, auditable, and cross-domain access control for resource-constrained IoT scenarios.
State channels provide an effective solution for blockchain scalability by migrating transaction execution off-chain. However, existing approaches typically rely on strong assumptions, such as a static set of participants, continuously online nodes, and extremely low failure rates. These assumptions are difficult to satisfy in intelligent terminal environments and significantly hinder practical deployment. To address these challenges, we propose a state channel framework with offline proxy and fault-tolerant recovery for intelligent terminals. The main contributions are summarized as follows: 1) To mitigate channel reconstruction overhead caused by frequent joining and leaving of intelligent terminals, a dynamic membership management mechanism is proposed. Based on joint group signatures and symmetric credential verification, it enables members to complete permission changes without exposing real identities, achieving privacy-preserving and secure admission in dynamic environments. 2) To address transaction interruption caused by intermittent connectivity of intelligent terminals, a trusted execution environment (TEE)-assisted offline proxy mechanism is designed. Participants delegate transaction signing and state updates to a locally deployed TEE array, where offline proxy execution is performed in an isolated environment, ensuring continuity of blockchain operations in asynchronous and dynamic scenarios. 3) To cope with node failures or state loss risks, a fault-tolerant state recovery mechanism based on low-density parity-check (LDPC) codes is proposed. Participant states are encoded into sparse fragments and distributed across the TEE array, and sparse parity-check decoding is exploited to achieve high-probability and efficient fault-tolerant recovery. Experimental results demonstrate that, compared with existing methods, the proposed framework improves transaction success rates by 1.36–1.51 times, reduces latency by 20%–30%, and maintains system availability above 95% even with 20% state data loss, exhibiting significant performance advantages in dynamic intelligent terminal environments and partial failure scenarios.
Federated learning (FL) enables collaborative model training without sharing raw data, making it well suited for collaborative intelligence among massive heterogeneous terminals in dynamic heterogeneous networks. However, its open participation mechanism makes FL vulnerable to poisoning attacks, where malicious clients can degrade the global model by performing label-flipping, backdoor injection, or model update manipulation. Existing poisoning defense methods primarily rely on robust aggregation strategies to mitigate malicious updates. Nevertheless, under data heterogeneity, these methods often suffer from limited adaptability, inaccurate anomaly detection caused by single-metric evaluation, and the loss of useful information due to hard filtering strategies. To address these issues, a unified poisoning defense framework for federated learning under data heterogeneity is proposed. The framework adopts ConTrust, a multidimensional consistency scoring-based defense method, as the foundation, which identifies malicious updates by jointly evaluating update direction consistency, update magnitude deviation, and principal subspace residuals. For non-independent and identically distributed (Non-IID) scenarios, HistTrust, a history behavior modeling-based defense method, is developed by incorporating local neighborhood references and cross-round reputation information, thereby mitigating the misclassification caused by data heterogeneity and improving malicious client identification. Experiments are conducted on MNIST, Fashion-MNIST, and CIFAR-10 datasets under multiple poisoning attack settings. Experimental results demonstrate that the proposed defense framework consistently reduces the attack success rate while maintaining high model accuracy under different data distributions, outperforming several representative defense methods in overall performance. The study indicates that designing differentiated defense mechanisms for different data distributions can effectively enhance the robustness of FL against poisoning attacks.
In dynamic heterogeneous networks, massive heterogeneous terminals result in dispersed and diverse security data. While federated learning enables collaborative intrusion detection across terminals without compromising data privacy, its open architecture is inherently vulnerable to Byzantine attacks, where malicious clients poison the global model by uploading crafted gradients. Existing Byzantine-robust methods are typically effective only against specific attack types and struggle to cope with the coexistence of multiple attacks in real-world environments. Moreover, they suffer from high false-negative rates under sparse real-traffic conditions, and the computational overhead of stacking multiple defenses is prohibitive for resource-constrained terminals. To address these challenges, we propose GF-FedIDS, a Byzantine-robust federated learning intrusion detection framework based on gradient fingerprint decision-making. By analyzing the gradient statistics of typical Byzantine attacks, we establish a deterministic mapping from attack patterns to optimal defenses and reveal their causal relationship. A gradient fingerprint decision tree is designed to adaptively select a single optimal defense strategy, achieving full-coverage robust aggregation at unit computational cost. Furthermore, a class-aware instance weighting mechanism is introduced to mitigate missed detections under data imbalance. Extensive experiments on three public datasets and eight attack types demonstrate that, in single-attack scenarios, the attack detection rate (ADR) of GF-FedIDS outperforms that of the best baseline across three datasets; in mixed-attack scenarios, ADR reaches 1.45–2.14 times; and under extreme imbalance with a 5% attack rate, ADR is 2.06–2.29 times that of the best baseline. Additionally, GF-FedIDS incurs only a 16% computational overhead compared with FedAvg, outperforming existing ensemble defense methods.
In dynamic heterogeneous networks, massive heterogeneous terminals face a severe communication bottleneck when performing distributed collaborative learning: the frequent exchange of large-scale model parameters among terminals incurs heavy communication overhead. To address this issue, we propose QStar, a quantum-native federated aggregation algorithm for heterogeneous terminals. Unlike existing quantum federated learning schemes that convert quantum model updates into classical bit strings before transmission, QStar performs the transmission and aggregation of model updates within the quantum domain: clients encode local parameter updates into quantum superposition states so that a single quantum state transmission carries diverse candidate update strategies, and the server performs projective measurements guided by historical optimization trajectories to complete aggregation directly within the quantum domain. This mechanism makes the cost of carrying multiple candidate updates grow logarithmically rather than linearly with the number of candidates, and embeds candidate comparison and selection into the quantum measurement itself. Extensive experiments in typical heterogeneous terminal collaboration scenarios show that, compared with quantum federated learning baselines based on classical parameter transmission, QStar improves convergence stability and attains higher classification accuracy than parameter-quantization-based schemes on tasks with more classes and more complex features, providing a feasible technical pathway for collaborative learning of massive heterogeneous terminals in dynamic heterogeneous networks.
External vulnerability knowledge is increasingly important for large language models (LLMs) to understand vulnerability targets, craft exploit payloads, and interpret verification evidence. Recent approaches incorporate external vulnerability knowledge via prompt, task planning and multi-agent collaboration, to improve automated penetration testing. However, automated vulnerability reproduction remains challenging because public exploit materials are often heterogeneous and loosely structured, spanning scripts, HTTP requests, command-line snippets, and walkthrough in natural language. Prior work has leveraged retrieval-augmented generation, PoC semantic repair, and exploit code generation to better utilize external vulnerability knowledge, but still constrained by environment dependencies, exploit semantic extraction and model hallucinations, weakening the trustworthiness of automated reproduction.
To address these issues, we propose ValidPoC, an LLM-driven framework for automated vulnerability reproduction that can convert heterogeneous exploit walkthrough or scripts into structured and reliable PoC-Nuclei templates. Specifically, ValidPoC defines a PoC semantic model that provides a unified representation of exploit logic, including request construction, payload generation, execution dependencies, and verification criteria. We develop a Semgrep-assisted semantic parsing mechanism to extract PoC Semantic IR from public exploit materials, including exploit scripts and natural-language descriptions, and construct structured Nuclei YAML templates for automated vulnerability reproduction. To improve reproduction reliability, we establish a closed-loop execution–evaluation–repair framework and a three-level validation model (L1–L3) for cross-validation across multiple execution evidence.We evaluate ValidPoC on 67 real-world vulnerability reproduction tasks. ValidPoC achieves a Pass@3 reproduction rate of 76.12% and consistently surpasses existing automated penetration testing frameworks, including PentestAgent and PentestGPT. In addition, it maintains competitive efficiency with respect to both execution time and token usage. These results demonstrate the effectiveness of ValidPoC in understanding heterogeneous exploit materials, generating PoC templates, and vulnerability reproduction.
With the deep integration of cloud-edge-end collaborative computing and IoT, the massive heterogeneous terminals in dynamic heterogeneous networks have become the core protection objects of cybersecurity systems. The multivariate time-series data generated by these intelligent terminals during continuous operation, including industrial control sensor logs and network traffic features, carry complete semantic information about terminal behavior. Accurate classification of such time-series data is a critical foundation for terminal threat detection. However, the data distribution imbalance caused by terminal heterogeneity poses three key challenges to existing time-series classification models. First, constrained by fixed-resolution processing paradigms, models struggle to capture multi-granularity threaten features across different time scales. Second, existing methods forcibly map all resolution features into a unified high-dimensional space, ignoring intrinsic differences in feature dimension distribution across time resolutions, introducing noise, feature redundancy, and limiting deployment feasibility on resource-constrained edge terminals. Third, performing joint classification with multiple resolutions at inference incurs significant time and memory overhead from the feature extraction and fusion of each resolution branch, further exacerbating the inherent tension between lightweight deployment and high-accuracy detection. To address the alignment between time resolutions and feature dimensions, we propose an adaptive multi-resolution representation learning (AdaMRL) model for dynamic heterogeneous networks, achieving bidirectional alignment and decoupling of time resolutions and feature dimensions. The core contributions of this work are as follows. First, a multi-resolution Matryoshka feature architecture is constructed, equipping each time resolution with an independent Matryoshka representation learning layer to adaptively select an appropriate dimensional subspace for representation learning. Second, a multi-resolution joint loss supervision mechanism is proposed, which applies synchronized constraints to representations at each resolution during training to enhance cross-resolution feature robustness and accelerate model convergence. Third, an adaptive dimension selection and ensemble strategy is designed, dynamically matching the optimal feature dimensionality to each resolution at inference, with collaborative decision-making via soft-voting. Extensive experiments on 10 UEA multivariate time-series benchmark datasets and the industrial IoT edge security dataset Edge-IIoTset demonstrate that AdaMRL achieves state-of-the-art classification performance. Compared with baseline models, the proposed method improves average classification accuracy by 0.78% and reduces redundant feature parameter computation by 27.3% under optimal adaptive configuration, striking an effective balance between detection accuracy and computational efficiency, and providing robust support for real-time security protection of edge heterogeneous terminals.
Anomaly detection for time series holds practical value in diverse fields such as financial risk control and industrial fault diagnosis, where the core challenge lies in constructing a representation space that effectively distinguishes between normal and anomalous patterns. However, the inherent characteristics of temporal data, coupled with the extreme scarcity of labeled anomalies, make it highly difficult to learn a representative mapping function with strong discriminative power, often leading to limited generalization capabilities. Meanwhile, contrastive representation learning constructs a discriminative feature space that clearly differentiates between instances, offering a more natural and promising solution for temporal anomaly detection. To address these challenges, we propose a dual anomaly-aware Transformer (DAT) model. By incorporating anomaly injection and anomaly awareness mechanisms, DAT is specifically enabled to capture the complex features of potential anomalous samples during the training phase. Additionally, a contextual contrastive loss function is adopted to guide a dual-branch structure for extracting more intrinsic and discriminative semantic features between normal and anomalous samples. Comprehensive experiments conducted on five public datasets demonstrate the superiority of DAT over 21 baseline models. The results show that DAT not only achieves competitive performance across all benchmark datasets but also achieves state-of-the-art (SOTA) performance on the MSL and PSM datasets.
Cross-domain graph anomaly detection aims to identify anomalies in a target-domain graph with limited labels, by leveraging both normal and anomalous samples from a source-domain graph. However, significant discrepancies in graph structures and feature distributions between different domains hinder effective knowledge transfer and limit cross-domain generalization. Moreover, the scarcity of labeled data in the target domain often induces ambiguous decision boundaries and unstable predictions during training. To address these challenges, we propose a cross-domain graph anomaly detection method that integrates dynamic prototypes with self-supervised transfer learning. Specifically, semantic prototypes are first constructed from the normal and anomaly samples in the source domain, and a bidirectional guidance strategy is then employed to align these prototypes with target-domain nodes in a shared semantic space, thereby alleviating cross-domain distribution shifts. To further enhance the stability and semantic discriminability, an exponential moving average mechanism is introduced for dynamic prototype updating. Subsequently, entropy minimization is applied to target-domain node embeddings to improve feature discriminability and reduce decision boundary ambiguity. Finally, pseudo anomaly scores can be well obtained by combining source-domain model predictions with unsupervised clustering results on the target domain data. Accordingly, high-confidence samples are selected as week supervision signals to iteratively refine the model, thereby improving both detection accuracy and robustness. Experimental results demonstrate that our method consistently outperforms state-of-the-art approaches in various cross-domain graph anomaly detection tasks, while validating its effectiveness and stability in cross-domain transfer scenarios.
Recently, the one-to-one label assignment rule has played a great role in removing non-maximum suppression (NMS) in the post-processing step and building an NMS-free end-to-end detection paradigm. However, this strict sample matching rule leads to a significant reduction in the number of positive samples during the training process, making it difficult for the model to fully mine the latent semantic information in the data during the feature representation learning stage, resulting in low learning efficiency. To this end, we propose a cross-label assignment knowledge distillation (CAKD) method for end-to-end object detection. This method combines the transfer learning mechanism of knowledge distillation with the end-to-end object detection algorithm to make up for the defects of the existing one-to-one label assignment rule and establishes an effective knowledge transfer path for the knowledge distillation framework to train end-to-end detection models. Specifically, the multi-scale features of the student model are first transferred to the detection head of the teacher model across models. Then, the student-teacher cross-label assignment predictions are compared with the teacher’s predictions to calculate the distillation loss. This method avoids directly forcing the student to imitate the teacher’s features, which leads to feature confusion and semantic misalignment. In addition, we also design an effective task-aware matching metric that comprehensively considers the quality of classification and regression, thus avoiding the problem of irrelevance between classification and localization tasks. We conduct a large number of experiments on COCO dataset to demonstrate the effectiveness of this method. By applying the cross-label assignment knowledge distillation method proposed in this paper to the non-end-to-end FCOS baseline model, it achieves a 38.8% non-NMS detection performance in terms of mean average precision (mAP), which is a 2.2 percentage point accuracy gain compared with the original detection performance with NMS.