首次系统研究图基模型的模型提取攻击,揭示其安全风险。
A Systematic Study of Model Extraction Attacks on Graph Foundation Models
- 设计六种攻击场景,模拟真实黑盒攻击条件。
- 仅用少量成本即可逼近目标模型性能,零样本能力几乎无损。
- 适合关注图模型安全的开发者与研究人员参考。
图机器学习在链接预测、异常检测和节点分类等任务中快速发展。随着模型规模扩大,预训练图模型成为宝贵的知识产权,因其蕴含大量计算与领域知识。在此基础上,图基础模型(GFMs)通过在大规模多样化数据上联合预训练图与文本编码器,实现结构与语义理解的统一,支持零样本推理,广泛应用于欺诈检测与生物医学分析。然而,高预训练成本与跨域知识使GFMs易受模型提取攻击(MEAs)。现有研究仅针对单图小规模图神经网络,对大规模多模态GFMs的安全性未加探讨。本文首次系统研究了针对GFMs的MEAs,提出黑盒威胁模型并定义六种实际攻击场景,涵盖领域级与图特定提取目标、架构不匹配、查询预算有限、部分节点访问及训练数据差异。为实现攻击,我们提出一种轻量级提取方法:通过监督回归图嵌入训练攻击者编码器。即使无对比预训练数据,该方法仍能保持与受害者文本编码器对齐,并保留其在未见图上的零样本推理能力。七组数据集实验表明,攻击者仅需极小比例的原始训练成本,即可近乎完美复现目标模型性能。结果揭示了GFMs显著扩大了模型提取攻击面,强调在大规模图学习系统部署中亟需安全防御机制。
原文摘要 · Abstract (English)
Graph machine learning has advanced rapidly in tasks such as link prediction, anomaly detection, and node classification. As models scale up, pretrained graph models have become valuable intellectual assets because they encode extensive computation and domain expertise. Building on these advances, Graph Foundation Models (GFMs) mark a major step forward by jointly pretraining graph and text encoders on massive and diverse data. This unifies structural and semantic understanding, enables zero-shot inference, and supports applications such as fraud detection and biomedical analysis. However, the high pretraining cost and broad cross-domain knowledge in GFMs also make them attractive targets for model extraction attacks (MEAs). Prior work has focused only on small graph neural networks trained on a single graph, leaving the security implications for large-scale and multimodal GFMs largely unexplored. This paper presents the first systematic study of MEAs against GFMs. We formalize a black-box threat model and define six practical attack scenarios covering domain-level and graph-specific extraction goals, architectural mismatch, limited query budgets, partial node access, and training data discrepancies. To instantiate these attacks, we introduce a lightweight extraction method that trains an attacker encoder using supervised regression of graph embeddings. Even without contrastive pretraining data, this method learns an encoder that stays aligned with the victim text encoder and preserves its zero-shot inference ability on unseen graphs. Experiments on seven datasets show that the attacker can approximate the victim model using only a tiny fraction of its original training cost, with almost no loss in accuracy. These findings reveal that GFMs greatly expand the MEA surface and highlight the need for deployment-aware security defenses in large-scale graph learning systems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。