SoK: Practical Aspects of Releasing Differentially Private Graphs
Nicholas D'Silva, Surya Nepal, Salil S. Kanhere

TL;DR
This paper surveys practical methods for releasing differentially private graphs, identifies vulnerabilities, and offers a framework to guide practitioners in method selection and evaluation, with applications to social network analysis.
Contribution
It introduces a comprehensive survey, identifies key vulnerabilities, and proposes a practitioner-oriented framework for evaluating differentially private graph release methods.
Findings
Developed a unified benchmark for state-of-the-art methods in social networks.
Applied the framework to two social network scenarios for evaluation.
Abstract
Graph data is increasingly prevalent across domains, offering analytical value but raising significant privacy concerns. Edges may encode sensitive relationships, while node attributes may contain sensitive entity or personal data. Differential Privacy (DP) has gained traction for its strong guarantees, yet applying DP to graphs is challenging because of their complex relational structure, leading to trade-offs between privacy and utility. Existing methods vary in privacy definitions, utility goals, and contextual settings, complicating comparison. For practitioners, this is compounded by DP's interpretability issues, contributing to misleading protection claims. To address this, we propose a novel systemisation of existing methods tailored to practical considerations and adaptable to varying practitioner objectives. Our contributions include: (i) a comprehensive survey of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
