Jinyin Chen;Chengyi Wang;Minying Ma;Haibin Zheng;Qi Xuan
{"title":"Double Whammy: Stealthy Data Manipulation-Aided Reconstruction Attack on Graph Federated Learning","authors":"Jinyin Chen;Chengyi Wang;Minying Ma;Haibin Zheng;Qi Xuan","doi":"10.1109/TCSS.2026.3709286","DOIUrl":null,"url":null,"abstract":"Graph federated learning (GFL) is one of the effective distributed learning paradigms for training graph neural network (GNN) on isolated graph data. It perfectly addresses the issue that GNN requires a large amount of labeled graph data without original data sharing. Unfortunately, recent research has constructed a successful graph reconstruction attack (GRA) on GFL. However, these attacks are still challenged in aspects of effectiveness and stealth. To address the issues, we propose the first <underline>D</u>ata <underline>Man</u>ipulation-aided <underline>Rec</u>onstruction attack on GFL, dubbed as <italic>DMan4Rec</i>. The malicious client is born to manipulate its locally collected data to enhance graph stealing privacy from benign ones, so as to construct a double whammy on GFL. It differs from previous work in three terms: 1) <italic>effectiveness</i> - to fully utilize the sparsity and feature smoothness of the graph, novel penalty terms are designed adaptive to diverse similarity functions for connected and unconnected node pairs, as well as incorporation label smoothing on top of the original cross-entropy loss; 2) <italic>scalability</i> - DMan4Rec is capable of both white-box and black-box attacks via training a supervised model to infer the posterior probabilities obtained from limited queries; 3) <italic>stealthiness</i> - by manipulating the malicious client’s node features, it can maintain the overall graph structure’s invariance and conceal the attack. Comprehensive experiments on four real datasets and three GNN models demonstrate that DMan4Rec achieves the state-of-the-art (SOTA) performance, e.g., the attack AUC and precision improved by 9.2% and 10.5%, respectively, compared with the SOTA. Particularly, DMan4Rec achieves an AUC score and a precision score of up to 99.59% and 99.56%, respectively, in black-box setting. Nevertheless, the complete overlap of the distribution graphs supports the stealthiness of the attack. Besides, DMan4Rec still beats the defensive GFL, which alarms a new threat to GFL.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"13 5","pages":"5674-5688"},"PeriodicalIF":4.6000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11614468/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/20 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0
Abstract
Graph federated learning (GFL) is one of the effective distributed learning paradigms for training graph neural network (GNN) on isolated graph data. It perfectly addresses the issue that GNN requires a large amount of labeled graph data without original data sharing. Unfortunately, recent research has constructed a successful graph reconstruction attack (GRA) on GFL. However, these attacks are still challenged in aspects of effectiveness and stealth. To address the issues, we propose the first Data Manipulation-aided Reconstruction attack on GFL, dubbed as DMan4Rec. The malicious client is born to manipulate its locally collected data to enhance graph stealing privacy from benign ones, so as to construct a double whammy on GFL. It differs from previous work in three terms: 1) effectiveness - to fully utilize the sparsity and feature smoothness of the graph, novel penalty terms are designed adaptive to diverse similarity functions for connected and unconnected node pairs, as well as incorporation label smoothing on top of the original cross-entropy loss; 2) scalability - DMan4Rec is capable of both white-box and black-box attacks via training a supervised model to infer the posterior probabilities obtained from limited queries; 3) stealthiness - by manipulating the malicious client’s node features, it can maintain the overall graph structure’s invariance and conceal the attack. Comprehensive experiments on four real datasets and three GNN models demonstrate that DMan4Rec achieves the state-of-the-art (SOTA) performance, e.g., the attack AUC and precision improved by 9.2% and 10.5%, respectively, compared with the SOTA. Particularly, DMan4Rec achieves an AUC score and a precision score of up to 99.59% and 99.56%, respectively, in black-box setting. Nevertheless, the complete overlap of the distribution graphs supports the stealthiness of the attack. Besides, DMan4Rec still beats the defensive GFL, which alarms a new threat to GFL.
期刊介绍:
IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.