1 citations · 1 across the 10 of their papers we have counts for
4 papers · 1 filter
Lower Bounds for Private Graph Optimization Problems using Reconstruction Attacks
Jacob Imola, Rasmus Pagh, Lukas Retschmeier
This paper studies fundamental graph optimization problems under differential privacy (DP) and shows new, reconstruction-based lower bounds. We consider a graph $G = (V, E, \vec{w}…
Differentially Private Quantiles with Smaller Error
Jacob Imola, Fabrizio Boninsegna, Hannah Keller +3
In the approximate quantiles problem, the goal is to output quantile estimates, the ranks of which are as close as possible to given quantiles $0 \leq q_1 \leq\dots \leq q_…
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Rasmus Pagh, Lukas Retschmeier, Hao Wu +1
We study the problem of privately releasing an approximate minimum spanning tree (MST). Given a graph where is a set of vertices, is a set of …
Faster Private Minimum Spanning Trees
Rasmus Pagh, Lukas Retschmeier
Motivated by applications in clustering and synthetic data generation, we consider the problem of releasing a minimum spanning tree (MST) under edge-weight differential privacy con…