arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.05429cs.CRcs.LG
收藏

针对图神经网络的节点级成员推断攻击

Node-Level Membership Inference Attacks Against Graph Neural Networks

CISPA Helmholtz Center for Information Security(亥姆霍兹信息安全中心);Sichuan University(四川大学);NortonLifeLock Research Group(诺顿LifeLock研究组)

Xinlei He, Rui Wen, Yixin Wu, Michael Backes, Yun Shen, Yang Zhang

摘要:

许多真实世界的数据以图表的形式出现,例如社交网络和蛋白质结构。为了充分利用图数据中包含的信息,已经引入了一种新的机器学习(ML)模型族,即图神经网络(GNNs)。此前的研究表明,机器学习模型容易受到隐私攻击。然而,目前的大部分努力都集中在基于欧几里得空间数据(如图像和文本)训练的ML模型上。另一方面,GNN产生的隐私风险在很大程度上仍未得到研究。在本文中,我们通过对GNN进行节点级成员推断攻击的第一次全面分析来填补这一空白。我们系统地定义了威胁模型,并提出了三个节点级的成员推断攻击对手的背景知识的基础上。我们对三种GNN结构和四个基准数据集的评估表明,即使对手具有最少的背景知识,GNN也容易受到节点级成员推断的影响。此外,我们表明,图密度和特征相似性有一个重大影响的攻击的成功。我们进一步研究了两种防御机制,实证结果表明,这些防御可以降低攻击性能,但有适度的效用损失。

英文摘要:

Many real-world data comes in the form of graphs, such as social networks and protein structure. To fully utilize the information contained in graph data, a new family of machine learning (ML) models, namely graph neural networks (GNNs), has been introduced. Previous studies have shown that machine learning models are vulnerable to privacy attacks. However, most of the current efforts concentrate on ML models trained on data from the Euclidean space, like images and texts. On the other hand, privacy risks stemming from GNNs remain largely unstudied. In this paper, we fill the gap by performing the first comprehensive analysis of node-level membership inference attacks against GNNs. We systematically define the threat models and propose three node-level membership inference attacks based on an adversary's background knowledge. Our evaluation on three GNN structures and four benchmark datasets shows that GNNs are vulnerable to node-level membership inference even when the adversary has minimal background knowledge. Besides, we show that graph density and feature similarity have a major impact on the attack's success. We further investigate two defense mechanisms and the empirical results indicate that these defenses can reduce the attack performance but with moderate utility loss.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑