Skip to content

Toward Personalized Differentially Private Learning for Decentralized Local Graphs

Jul 2026 · IEEE Transactions on Knowledge and Data Engineering · Vol 38, pp. 6255-6269 · 0 citations · 57 references
Computer Science

TL;DR

PPGNN, a personalized differentially private framework for decentralized graph data, enables user-specific privacy budgets during local perturbation while preserving analytical utility in decentralized graph learning scenarios.

Abstract

Graph-structured data is increasingly generated and stored in decentralized environments, such as social platforms, mobile applications, and edge networks, where users maintain control over their local graph data. However, collecting and analyzing such decentralized graph data for downstream learning tasks raises significant privacy concerns, as nodes and their attributes often contain sensitive personal information. Local Differential Privacy (LDP) has emerged as a promising solution for privacy-preserving data collection without relying on trusted servers. Nevertheless, existing LDP-based graph learning methods typically assume uniform privacy requirements across users, ignoring the heterogeneous and personalized privacy preferences commonly observed in real-world systems. This uniform treatment leads to inflexible noise injection at the data collection stage, resulting in substantial distortion of graph data and degraded utility in subsequent analysis. To address this limitation, we propose PPGNN, a personalized differentially private framework for decentralized graph data. PPGNN enables user-specific privacy budgets during local perturbation while preserving analytical utility. To handle heterogeneous privacy levels and noise distortion, we design a two-stage solution consisting of a Personalized Perturbation Mechanism (PPM) and a weighted calibration strategy, FlexProp. Extensive experiments on six real-world graph datasets demonstrate that PPGNN effectively balances personalized privacy protection and data utility in decentralized graph learning scenarios.

View source

Similar papers

Review

Differentially Private Graph Learning: A Survey

This survey presents the first comprehensive and systematic review of Differentially Private Graph Learning (DPGL), and organizes existing DPGL methods into four categories based on the granularity of privacy protection, namely node-level, edge-level, graph-level, and node-level.

Longzhu He, Li Sun, Ming Li et al. · 0 citations
Jul 2026

DPEI: Privacy Budget Savings for Edge Information Protection in Synthetic Graph Publishing

With the widespread adoption of graph-structured data, protecting the complex relational information between nodes and edges while preventing sensitive information leakage has become a critical challenge. However, existing edge protection methods either introduce noise directly into the adjacency matrix, resulting in significant information loss, or uniformly apply noise across all edges, leading to imbalanced privacy budget allocation and inefficiency. To address these issues, we propose DPEI, a Differential Privacy-based Edge Information protection solution designed to safeguard the edge relationships between two nodes, thus reducing the risk of privacy leakage and preventing attackers from repeatedly inferring internal community relationships from the released graph data. Specifically, DPEI achieves protection through PPO (Proximal Policy Optimization)based selection of locally optimal thresholds combined with adaptive Laplace noise operations, and attachment nodes below the threshold into high-information edges to enhance relational information protection. Subsequently, unlike traditional uniform allocation, DPEI distributes the privacy budget in proportion to the information content of each edge, ensuring that edges with higher information content receive stronger privacy protection. Extensive experiments conducted on three real-world graph datasets demonstrate that DPEI significantly outperforms existing methods across seven commonly used graph metrics, thereby validating its effectiveness and practicality.

Ruizhong Du, Zi-Zhan Wei, Mingyue Li · 0 citations
Preprint Aug 2026

PriDyG: Privacy-preserving Dynamic Graph Inference with LLM-GNN Collaboration

Experiments on four benchmarks for node classification and link prediction show that PriDyG consistently outperforms geometrically decaying baselines under the same privacy budget and matches the utility of naive per-update retraining while reducing cumulative privacy cost by up to three orders of magnitude.

Yuyang Xia, Ruixuan Liu, Li Xiong · 0 citations
Open access Oct 2026

CoP: Coordinated Perturbation for Controlled Disclosure Under Local Differential Privacy

CoP is proposed, a coordinated perturbation mechanism designed to mitigate CIL in multidimensional data collection while preserving utility and significantly outperforms state-of-the-art LDP mechanisms in reducing disclosure while preserving analytical accuracy.

Sandaru Jayawardana, Ming Ding, Kanchana Thilakarathna · 0 citations
Preprint Jul 2026

Privacy Preserving Recommender Systems Balancing Personalization with Privacy

This work presents and evaluates a privacy-preserving recommendation framework that combines federated learning, differential privacy, cohort-level modeling, and privacy-aware intelligent agents, offering a scalable approach for next-generation AI-driven retail platforms.

Ranjeet K Jha, Venkata Suresh Gummadilli · 0 citations
#diffusion models Open access Oct 2026

Measuring Legislature-Aligned Privacy Risks in Synthetic Graphs

SyntheGrAnon is introduced, a framework for evaluating synthetic graph anonymity that primarily targets the singling out, linkability, and inference risks outlined in the EU GDPR at the node and community levels, while also including edge-level attacks as an extension of the node-level setting.

Abele Malan, Ahmad Al Kurdi, Stefanie Roos et al. · 0 citations