Finding MNEMON: Reviving Memories of Node Embeddings

11Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Shen, Y., Han, Y., Zhang, Z., Chen, M., Yu, T., Backes, M., … Stringhini, G. (2022). Finding MNEMON: Reviving Memories of Node Embeddings. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 2643–2657). Association for Computing Machinery. https://doi.org/10.1145/3548606.3559358

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free