Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs

  title={Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs},
  author={Laxman Dhulipala and Quanquan C. Liu and Sofya Raskhodnikova and Jessica Shi and Julian Shun and Shangdi Yu},
  journal={2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)},
Differentially private algorithms allow large-scale data analytics while preserving user privacy. Designing such algorithms for graph data is gaining importance with the growth of large networks that model various (sensitive) relationships between individuals. While there exists a rich history of important literature in this space, to the best of our knowledge, no results formalize a relationship between certain parallel and distributed graph algorithms and differentially private graph analysis… 

Figures and Tables from this paper



Locally Differentially Private Analysis of Graph Statistics

This work considers a local model, and presents algorithms for counting subgraphs -- a fundamental task for analyzing the connection patterns in a graph -- with LDP (Local Differential Privacy), and shows that it is indeed possible to accurately estimate subgraph counts in the local differential privacy model.

Private Analysis of Graph Structure

This work extends the approach of Nissim et al. to a new class of statistics, namely k-star queries, and gives hardness results indicating that the approach used for triangles cannot easily be extended to k-triangles.

Analyzing Graphs with Node Differential Privacy

A generic, efficient reduction is derived that allows us to apply any differentially private algorithm for bounded-degree graphs to an arbitrary graph, based on analyzing the smooth sensitivity of the 'naive' truncation that simply discards nodes of high degree.

Differentially Private Densest Subgraph

This paper studies the densest subgraph problem in the framework of differential privacy, and derives upper and lower bounds for this problem, and shows that there exists a linear-time algorithm that has an extra poly-logarithmic additive error.

Differentially Private Densest Subgraph Detection

This work studies the densest subgraph problem in the edge privacy model, in which the edges of the graph are private, and presents the first sequential and parallel differentially private algorithms for this problem.

On Differentially Private Graph Sparsification and Applications

An algorithm is given that given an input graph, returns a sparse graph which approximates the spectrum of the input graph while ensuring differential privacy, which allows one to solve many graph problems privately yet efficiently and accurately.

Differentially Private Algorithms for Graphs Under Continual Observation

This work presents event-level and user-level private algorithms for partially dynamic counting-based problems such as triangle count that improve the additive error by a polynomial factor on the state of the art, resulting in the first algorithms with additive error polylogarithmic in T .

Exponential random graph estimation under differential privacy

This work proposes algorithms for privately estimating the parameters of exponential random graph models (ERGMs) and considers specific alternating statistics that are in common use for ERGM models and describes a method for estimating them privately by adding noise proportional to a high-confidence bound on their local sensitivity.

Differentially private graph publishing with degree distribution preservation

Recursive mechanism: towards node differential privacy and unrestricted joins

A novel differentially private mechanism that supports unrestricted joins is proposed, to release an approximation of a linear statistic of the result of some positive relational algebra calculation over a sensitive database.