Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Finding MNEMON: Reviving Memories of Node Embeddings (2204.06963v2)

Published 14 Apr 2022 in cs.LG, cs.CR, and stat.ML

Abstract: Previous security research efforts orbiting around graphs have been exclusively focusing on either (de-)anonymizing the graphs or understanding the security and privacy issues of graph neural networks. Little attention has been paid to understand the privacy risks of integrating the output from graph embedding models (e.g., node embeddings) with complex downstream machine learning pipelines. In this paper, we fill this gap and propose a novel model-agnostic graph recovery attack that exploits the implicit graph structural information preserved in the embeddings of graph nodes. We show that an adversary can recover edges with decent accuracy by only gaining access to the node embedding matrix of the original graph without interactions with the node embedding models. We demonstrate the effectiveness and applicability of our graph recovery attack through extensive experiments.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (8)
  1. Yun Shen (61 papers)
  2. Yufei Han (26 papers)
  3. Zhikun Zhang (39 papers)
  4. Min Chen (200 papers)
  5. Ting Yu (126 papers)
  6. Michael Backes (157 papers)
  7. Yang Zhang (1132 papers)
  8. Gianluca Stringhini (77 papers)
Citations (12)

Summary

We haven't generated a summary for this paper yet.