Finding MNEMON: Reviving Memories of Node Embeddings
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 45 of its 91 references that are in the map. First posted on arXiv 14 Apr 2022.
Builds on
45 of 91 references.
References · 45
- 2017Attention Is All You Needcited by 59,932
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2016Complex Embeddings for Simple Link Predictioncited by 897
- 2018Link Prediction Based on Graph Neural Networkscited by 829
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2019Federated Machine Learning: Concept and Applicationscited by 409
33 more
- 2019Devign: Effective Vulnerability Identification by Learning Comprehensive Program Semantics via Graph Neural Networkscited by 266
- 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
- 2016Molecular Graph Convolutions: Moving Beyond Fingerprintscited by 238
- 2019Learning Discrete Structures for Graph Neural Networkscited by 228
- 2020Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddingscited by 212
- 2019Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacementcited by 205
- 2017Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2veccited by 197
- 2017Graph Embedding Techniques, Applications, and Performance: A Surveycited by 188
- 2020When Machine Unlearning Jeopardizes Privacycited by 181
- 2018Adversarial Attack and Defense on Graph Data: A Surveycited by 166
- 2017Machine Learning Models that Remember Too Muchcited by 165
- 2016How to learn a graph from smooth signalscited by 146
- 2018DeepInf: Social Influence Prediction with Deep Learningcited by 128
- 2020Backdoor Attacks to Graph Neural Networkscited by 126
- 2020Stealing Links from Graph Neural Networkscited by 114
- 2020Graph Backdoorcited by 112
- 2019Graph Normalizing Flowscited by 103
- 2017Network Representation Learning: A Surveycited by 101
- 2021Sequential Recommendation with Graph Neural Networkscited by 89
- 2020Differentiable Graph Module (DGM) for Graph Convolutional Networkscited by 86
- 2020Quantifying Privacy Leakage in Graph Embeddingcited by 82
- 2021LinkTeller: Recovering Private Edges from Graph Neural Networks via Influence Analysiscited by 65
- 2021Membership Inference Attacks Against Recommender Systemscited by 52
- 2021Model Stealing Attacks Against Inductive Graph Neural Networkscited by 50
- 2019NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorizationcited by 48
- 2013Clustering and Community Detection in Directed Networks: A Surveycited by 38
- 2021Honest-but-Curious Nets: Sensitive Attributes of Private Inputs Can Be Secretly Coded into the Classifiers' Outputscited by 18
- 2020Simple and Effective Graph Autoencoders with One-Hop Linear Modelscited by 17
- 2020Little Ball of Fur: A Python Library for Graph Samplingcited by 15
- 2018Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagationcited by 14
- 2016Network structure, metadata and the prediction of missing nodes and annotationscited by 8
- 2021DeepWalking Backwards: From Embeddings Back to Graphscited by 6
- 2020Spikyball sampling: Exploring large networks via an inhomogeneous filtered diffusioncited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 1.
4 papers.
- 2023DPMLBench: Holistic Evaluation of Differentially Private Machine Learningcited by 13
- 2024Model Inversion Attacks: A Survey of Approaches and Countermeasurescited by 11
- 2026Inference Attacks Against Graph Generative Diffusion Modelscited by 2
- 2024Towards Deeper Understanding of PPR-based Embedding Approaches: A Topological Perspectivecited by 0
- 2026Inference Attacks Against Graph Generative Diffusion Models7 Jan 2026
- 2024Model Inversion Attacks: A Survey of Approaches and Countermeasures15 Nov 2024
- 2024Towards Deeper Understanding of PPR-based Embedding Approaches: A Topological Perspective30 May 2024
- 2023DPMLBench: Holistic Evaluation of Differentially Private Machine Learning10 May 2023