Pith. sign in

REVIEW 4 cited by

Link Stealing Attacks Against Inductive Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.05784 v1 pith:O2SWFWEZ submitted 2024-05-09 cs.CR cs.LG

classification cs.CRcs.LG
keywords attacksinductivesettinggnnsgraphlinkstealingneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A graph neural network (GNN) is a type of neural network that is specifically designed to process graph-structured data. Typically, GNNs can be implemented in two settings, including the transductive setting and the inductive setting. In the transductive setting, the trained model can only predict the labels of nodes that were observed at the training time. In the inductive setting, the trained model can be generalized to new nodes/graphs. Due to its flexibility, the inductive setting is the most popular GNN setting at the moment. Previous work has shown that transductive GNNs are vulnerable to a series of privacy attacks. However, a comprehensive privacy analysis of inductive GNN models is still missing. This paper fills the gap by conducting a systematic privacy analysis of inductive GNNs through the lens of link stealing attacks, one of the most popular attacks that are specifically designed for GNNs. We propose two types of link stealing attacks, i.e., posterior-only attacks and combined attacks. We define threat models of the posterior-only attacks with respect to node topology and the combined attacks by considering combinations of posteriors, node attributes, and graph features. Extensive evaluation on six real-world datasets demonstrates that inductive GNNs leak rich information that enables link stealing attacks with advantageous properties. Even attacks with no knowledge about graph structures can be effective. We also show that our attacks are robust to different node similarities and different graph features. As a counterpart, we investigate two possible defenses and discover they are ineffective against our attacks, which calls for more effective defenses.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. GRID: Protecting Training Graph from Link Stealing Attacks on GNN Models

    cs.LG 2025-01 conditional novelty 6.0 of 10

    GRID adds crafted noise to prediction vectors of selected core nodes so linked node pairs look like n-hop unlinked pairs, while preserving predicted labels.

  2. Sub-optimal Learning in Meta-Classifier Attacks: A Study of Membership Inference on Differentially Private Location Aggregates

    cs.CR 2024-12 conditional novelty 6.0 of 10

    MLP-based membership inference attacks on DP location aggregates learn only a one-threshold rule, which underperforms under Laplace noise, and 200k training samples let them learn the better two-threshold rule.

  3. Stealing Training Graphs from Graph Neural Networks

    cs.LG 2024-11 conditional novelty 6.0 of 10

    A white-box attack called GraphSteal reconstructs exact training molecules from a trained GNN by generating candidates with a diffusion model and selecting those whose gradients best explain the model parameters.

  4. A Systematic Survey of Model Extraction Attacks and Defenses: State-of-the-Art and Perspectives

    cs.CR 2025-08 conditional novelty 4.0 of 10

    The paper classifies model extraction attacks and defenses into attack, defense, and computing environment categories and surveys their current state.

Pith tools