Double Whammy: Stealthy Data Manipulation-Aided Reconstruction Attack on Graph Federated Learning

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
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.
双重打击:对图联邦学习的隐形数据操纵辅助重建攻击
图联邦学习(GFL)是在孤立图数据上训练图神经网络(GNN)的有效的分布式学习范式之一。它很好地解决了GNN需要大量带标签的图数据而没有原始数据共享的问题。不幸的是,最近的研究已经构建了一个成功的图重建攻击(GRA)。然而,这些攻击在有效性和隐蔽性方面仍然受到挑战。为了解决这些问题,我们提出了第一个针对GFL的数据操纵辅助重建攻击,称为DMan4Rec。恶意客户端通过对其本地采集的数据进行操纵,增强对良性客户端的图形窃取隐私,从而对GFL构成双重打击。与以往的研究有三个方面的不同:1)有效性——为了充分利用图的稀疏性和特征平滑性,设计了新的惩罚项来适应连接和未连接节点对不同的相似度函数,并在原有交叉熵损失的基础上进行了合并标签平滑;2)可扩展性- DMan4Rec能够通过训练一个监督模型来推断从有限查询中获得的后验概率来进行白盒和黑盒攻击;3)隐身性——通过操纵恶意客户端的节点特征,保持整体图结构的不变性,隐藏攻击。在4个真实数据集和3种GNN模型上的综合实验表明,DMan4Rec达到了最先进的SOTA性能,攻击AUC和精度分别比SOTA提高了9.2%和10.5%。特别是,DMan4Rec在黑盒环境下的AUC得分和精度得分分别高达99.59%和99.56%。然而,分布图的完全重叠支持了攻击的隐蔽性。此外,DMan4Rec仍然击败了防御性的GFL,这对GFL构成了新的威胁。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书