paper-with-me

홈 › Papers

Local Differential Privacy in Graph Neural Networks: a Reconstruction Approach

2023-09-15 · Karuna Bhaila, Wen Huang, Yongkai Wu, Xintao Wu

Graph Neural Networks have achieved tremendous success in modeling complex graph data in a variety of applications. However, there are limited studies investigating privacy protection in GNNs. In this work, we propose a learning framework that can provide node privacy at the user level, while incurring low utility loss. We focus on a decentralized notion of Differential Privacy, namely Local Differential Privacy, and apply randomization mechanisms to perturb both feature and label data at the node level before the data is collected by a central server for model training. Specifically, we investigate the application of randomization mechanisms in high-dimensional feature settings and propose an LDP protocol with strict privacy guarantees. Based on frequency estimation in statistical analysis of randomized data, we develop reconstruction methods to approximate features and labels from perturbed data. We also formulate this learning framework to utilize frequency estimates of graph clusters to supervise the training procedure at a sub-graph level. Extensive experiments on real-world and semi-synthetic datasets demonstrate the validity of our proposed model.

📄 PDF Abstract BibTeX arXiv:2309.08569

Code (2)

karuna-bhaila/rgnn 공식 구현 pytorch
MindSpore-scientific/code-11/tree/main/RGNN mindspore

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions

2023-12-12 · Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya

We suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy. While various algorithms exist for computing graph statistics, including the count o…

Data CompressionSubgraph Counting

EdgeRefine: Privacy-Utility Balance for Graphs via Jaccard Sampling under Edge Differential Privacy

2026-07-09 · Wenxiu Ding, Muzhi Liu, Zheng Yan, Mingjun Wang 외 arxiv

Graph Neural Networks (GNNs) have shown considerable success in learning from graph-structured data, but their use in privacy-sensitive areas remains difficult because graph structure can leak sensitive link information.…

Graph ClassificationNode ClassificationGraph Learning

Assessing Differentially Private Variational Autoencoders under Membership Inference

2022-04-16 · Daniel Bernau, Jonas Robl, Florian Kerschbaum

We present an approach to quantify and compare the privacy-accuracy trade-off for differentially private Variational Autoencoders. Our work complements previous work in two aspects. First, we evaluate the the strong reco…

Time SeriesTime Series Analysis

Signal Recovery from Random Dot-Product Graphs Under Local Differential Privacy

2025-04-24 · Siddharth Vishwanath, Jonathan Hehir

We consider the problem of recovering latent information from graphs under $\varepsilon$-edge local differential privacy where the presence of relationships/edges between two users/vertices remains confidential, even fro…

Community Detection

Towards Private Learning on Decentralized Graphs with Local Differential Privacy

2022-01-23 · WanYu Lin, Baochun Li, Cong Wang

Many real-world networks are inherently decentralized. For example, in social networks, each user maintains a local view of a social graph, such as a list of friends and her profile. It is typical to collect these local …

BenchmarkingGraph LearningPrivacy Preserving