Ming Liu

Ming Liu

Auto-generated profile, based on publicly available information

Ming Liu

Guangzhou Research Institute of Information Technology, Guangzhou, Guangdong, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 December 2023 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
STShouhong Tan
Shouhong Tan
FHFengrui Hao
Fengrui Hao
TGTianlong Gu
Tianlong Gu
Long LiLong Li
Long Li
MLMing Liu
Ming Liu
As a privacy-preserving machine learning paradigm, federated learning (FL) has attracted widespread attention from both academia and industry. Decentralized FL (DFL) overcomes the problems of untrusted aggregation server, single point of failure and poor scalability in traditional FL, making it suitable for industrial Internet of Things (IIoT). However, DFL provides more convenient conditions for malicious participants to launch attacks. This article focuses on the model poisoning attack in DFL for the first time, and proposes a novel attack method called collusive model poisoning attack (CMPA). To implement CMPA, we propose the dynamic adaptive construction mechanism, in which malicious participants can dynamically and adaptively construct malicious local models that meet distance constraints, reducing the convergence speed and accuracy of consensus models. Furthermore, we design the collusion-based attack enhancement strategies, where multiple participants can collude in the process of constructing malicious local models to improve the strength of attack. Empirical experiments conducted on MNIST and CIFAR-10 datasets reveal that CMPA significantly impacts the training process and results of DFL. Attack tests against representative defense methods show that CMPA not only invalidates statistical-based defenses but also skillfully overcomes performance-based methods, further proving its effectiveness and stealthiness. In addition, experiments based on practical IIoT scenario have also shown that CMPA can effectively disrupt system functionality.

23 April 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
MXMinghao Xu
Minghao Xu
FHFengrui Hao
Fengrui Hao
TGTianlong Gu
Tianlong Gu
MLMing Liu
Ming Liu
Graph neural networks (GNNs) are a set of methods that aim to apply deep neural networks to graph-structured data. Despite their promising performance on various graph analysis tasks, they might have discrimination towards certain populations when exploited in human-centered applications without fairness considerations. Moreover, extant studies have shown that GNNs are vulnerable to backdoor attacks, through which malicious users can degrade the predication performance of GNNs. Nevertheless, attacks to the fairness of GNNs are still unexplored. In this paper, we analyze the limitations of existing GNNs backdoor attacks, and propose a novel fairness backdoor attack (FBA) method for GNNs. Firstly, we provide the candidate space selection mechanism to select the fair node candidate space using the long-tail distribution, which facilitates the subsequent generation of triggers. Secondly, we develop the trigger generation strategy to generate fairness triggers by quantifying the deviations between different groups of sensitive attributes, enabling the attack to degrade the fairness almost without affecting the accuracy. Finally, we undertake extensive evaluation experiments on real datasets and state-of-the-art models to demonstrate the effectiveness of the FBA method, including five mainstream models (GCN, GraphSAGE, GAT, GAE, and VGAE), three downstream tasks (node classification, graph classification and link prediction), and two fair GNNs (NIFTY and Fairedit).