13 February 2025 in IEEE Transactions on Information Forensics and Security
With increasing cyber attacks over the Internet, network intrusion detection systems (NIDS) have been an indispensable barrier to protecting network security. Taking advantage of automatically capturing topology connections, recent deep graph learning approaches have achieved remarkable performance in distinguishing different types of malicious flows. However, there remain some critical challenges. 1) previous supervised learning methods rely heavily on abundant and high-quality annotated samples, while label annotation requires abundant time and expert knowledge. 2) Centralized methods require all data to be uploaded to a server for learning behavior patterns, which results in high detection latency and critical privacy leakage. 3) Diverse attack scenarios exhibit highly imbalanced distribution, making it hard to characterize abnormal behaviors. To address these issues, we proposed FeCoGraph, a label-aware federated graph contrastive learning framework for intrusion detection in few-shot scenarios. The line graph is introduced to directly process flow embeddings, which are compatible with diverse GNNs. Furthermore, We formulate a graph contrastive learning task to effectively leverage label information, allowing intra-class embeddings more compact than inter-class embeddings. To improve the scalability of NIDS, we utilize federated learning to cover more attack scenarios while protecting data privacy. Experiment results show that FeCoGraph surpass E-graphSAGE with an average 8.36% accuracy on binary classification and 6.77% accuracy on multiclass classification, demonstrating the efficiency of our approach.
25 October 2023 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Blockchain data mining has the potential to reveal the operational status and behavioral patterns of anonymous participants in blockchain systems, thus providing valuable insights into system operation and participant behavior. However, traditional blockchain analysis methods suffer from the problems of being unable to handle the data due to its large volume and complex structure. With powerful computing and analysis capabilities, graph learning can solve the current problems through handling each node's features and linkage relationships separately and exploring the implicit properties of data from a graph perspective. This paper systematically reviews the blockchain data mining tasks based on graph learning approaches. First, we investigate the blockchain data acquisition method, integrate the currently available data analysis tools, and divide the sampling method into rule-based and cluster-based techniques. Second, we classify the graph construction into transaction-based blockchain and account-based methods, and comprehensively analyze the existing blockchain feature extraction methods. Third, we compare the existing graph learning algorithms on blockchain and classify them into traditional machine learning-based, graph representation-based, and graph deep learning-based methods. Finally, we propose future research directions and open issues which are promising to address.
25 October 2022 in IEEE Transactions on Intelligent Transportation Systems
Traffic forecasting is essential in improving and maintaining safety and orderliness in intelligent transportation systems (ITS). As a deep learning approach, graph neural networks (GNN) based spatial-temporal association mining methods are promising in traffic forecasting. However, current GNN-based methods usually require a high number of training data, and when the sample volume is small, the performance of the model drops dramatically. The existing transfer methods can solve this problem by leveraging knowledge from other data-rich areas, but the domain adaption method with access to source data still faces the non-neglectable problem of private information leakage in the source area. A solution that can solve cross-area transfer without access to source data is still missing. In this paper, to fill the gap, we propose a Transferable Federated Inductive Spatial-Temporal Graph Neural Network (T-ISTGNN) framework to transfer spatial-temporal dependency information in cross-area data to accomplish traffic state forecasting. First, we introduce a multi-source model aggregation scheme based on federated learning to retain the traffic information of the source areas. Second, we propose a transfer method between source and target areas based on hypothesis transfer learning to achieve domain adaption under source domain data protection. Third, we propose a GNN-based method called Inductive Spatial-Temporal Graph Neural Network (ISTGNN) for traffic forecasting. Experiments on real-world datasets demonstrate that T-ISTGNN is capable of cross-area traffic state forecasting under the restriction of preserving the privacy of source areas.
14 July 2023 in IEEE Systems Journal
Swarm learning (SL) is a novel decentralized machine learning paradigm that provides a privacy-preserving approach based on permissioned blockchain without the need for a centralized coordinator. However, the various architectures and design characteristics of blockchains make it difficult to employ applications on heterogeneous blockchains, which limits the scalability, efficiency, and interoperability of blockchains ecology and restricts the application of SL. To solve this problem, first, we propose a Blockchain Twin mechanism consisting of multichains to enable model sharing between heterogeneous blockchains without single central relay-chain. Next, to encourage roles in Blockchain Twin to actively and honestly participate in consensus phase, we design a multileader multifollower Stackelberg game-based incentive mechanism. Additionally, we prove that a unique Stackelberg equilibrium exists in the game and propose an alternating direction method of multipliers (ADMM)-based algorithm to obtain the optimal solution. Finally, we evaluate the performance of twin-chain interactions regarding average delay and throughput. We also conduct numerical simulation on the proposed incentive mechanism, and the results show that our mechanism can jointly maximize the reward of every participant roles in Blockchain Twin.
30 July 2025 in IEEE Transactions on Information Forensics and Security
Graph Neural Networks (GNNs) have demonstrated remarkable potential in various downstream tasks by effectively capturing the relational dependencies among nodes in graphs. However, this capability also brings significant privacy risks: when GNNs encode topological information and node features into their output, sensitive information can be inadvertently exposed, leading to severe privacy breaches. Existing privacy-preserving GNNs primarily focus on protecting the existence of individual nodes or edges, overlooking practical scenarios where nodes and edges are often publicly accessible and only specific sensitive attributes require protection, resulting in a lack of consideration for attribute sensitivity and challenges in balancing privacy and utility. In this paper, we study the problem of hiding sensitive information during GNN training and limiting its exposure in the outputs, while better defending against attribute inference attacks (AIAs) and achieving improved performance. To achieve this, we propose an attribute-oriented differentially private graph neural network (AODP-GNN) that enforces attribute-specific privacy guarantees through dynamic privacy budgets and relevance-aware noise injection, optimizing the balance between privacy and utility. Specifically, we design a neighborhood-aware private embedding generation mechanism and a mutual information minimization-based optimization strategy that operate before the deep interactions of feature interaction and model optimization to strengthen defense against AIAs. To enhance the balance between privacy and utility, we further develop a relevance-grained noise adaptation technique that dynamically allocates higher noise to less relevant attributes. Theoretical analysis shows that the AODP-GNN satisfies privacy guarantees. Extensive experiments conducted on four real-world datasets demonstrate that our approach can achieve up to around 10. 04% and 9. 21% higher accuracy compared to the state-of-the-art centrally differentially private GNN ProGAP and DPDGC, and also shows a higher defense capability against AIAs.