提出新型图神经网络反向攻击,揭示删除数据仍可被恢复的隐私漏洞
Unlearning Inversion Attacks for Graph Neural Networks
- 利用模型置信度下降特征定位被删边附近节点
- 自适应调整未保留与保留边的相似度阈值,提升攻击精度
- 在4个真实数据集上超越现有方法,警示当前去敏感化技术缺陷
图去敏感化方法旨在无需全量重训练即可移除敏感数据的影响,前提是被删除信息不可恢复。本文挑战这一假设,提出图去敏感化反向攻击:仅通过黑盒访问未学习的GNN及部分图结构知识,攻击者能否重构被删除边?我们识别出两大关键挑战:未学习边与保留边的概率-相似度阈值差异,以及未学习边端点定位困难,并提出TrendAttack。首先,我们发现并利用置信度陷阱——即与被删边相邻节点的模型置信度显著下降的理论与实证规律;其次,设计自适应预测机制,对未学习边与其它成员边采用不同相似度阈值。该框架可灵活集成现有成员推断技术,并引入趋势特征。在四个真实世界数据集上的实验表明,TrendAttack显著优于现有最先进的GNN成员推断基线,暴露了当前图去敏感化方法中的关键隐私漏洞。
原文摘要 · Abstract (English)
Graph unlearning methods aim to efficiently remove the impact of sensitive data from trained GNNs without full retraining, assuming that deleted information cannot be recovered. In this work, we challenge this assumption by introducing the graph unlearning inversion attack: given only black-box access to an unlearned GNN and partial graph knowledge, can an adversary reconstruct the removed edges? We identify two key challenges: varying probability-similarity thresholds for unlearned versus retained edges, and the difficulty of locating unlearned edge endpoints, and address them with TrendAttack. First, we derive and exploit the confidence pitfall, a theoretical and empirical pattern showing that nodes adjacent to unlearned edges exhibit a large drop in model confidence. Second, we design an adaptive prediction mechanism that applies different similarity thresholds to unlearned and other membership edges. Our framework flexibly integrates existing membership inference techniques and extends them with trend features. Experiments on four real-world datasets demonstrate that TrendAttack significantly outperforms state-of-the-art GNN membership inference baselines, exposing a critical privacy vulnerability in current graph unlearning methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。