2020

Quantifying Privacy Leakage in Graph Embedding

Duddu, Vasisht, Boutet, Antoine, Shejwalkar, Virat

Understand

Graph embeddings have been proposed to map graph data to low dimensional space for downstream processing (e.g., node classification or link prediction).

  • With the increasing collection of personal data, graph embeddings can be trained on private and sensitive data.
  • For the first time, we quantify the privacy leakage in graph embeddings through three inference attacks targeting Graph Neural Networks.
  • We propose a membership inference attack to infer whether a graph node corresponding to individual user's data was member of the model's training or not.

Reading the bibliography…