Releasing all pairwise shortest path (APSP) distances between vertices on general graphs under weight Differential Privacy (DP) is known as a challenging task. In the previous attempt of (Sealfon 2016}, by adding Laplace noise to each edge weight or to each output distance, to achieve DP with some fixed budget, with high probability the maximal absolute error among all published pairwise distances is roughly $O(n)$ where $n$ is the number of nodes. It was shown that this error could be reduced for some special graphs, which, however, is hard for general graphs. Therefore, whether the approximation error can be reduced to sublinear in $n$ is posted as an interesting open problem.
We break the linear barrier on the distance approximation error of previous result, by proposing an algorithm that releases a constructed synthetic graph privately. Computing all pairwise distances on the constructed graph only introduces $\tilde O(n^{1/2})$ error in answering all pairwise shortest path distances for fixed privacy parameter. Our method is based on a novel graph diameter (link length) augmentation via constructing "shortcuts" for the paths. By adding a set of shortcut edges to the original graph, we show that any node pair has a shortest path with link length $\tilde O(n^{1/2})$. Then by adding noises with some positive mean to the edge weights, we show that the new graph is differentially private and can be published to answer all pairwise shortest path distances with $\tilde O(n^{1/2})$ approximation error using standard APSP computation.
Additionally, we consider the graph with small feedback vertex set number. A feedback vertex set (FVS) of a graph is a set of vertices whose removal leaves a graph without cycles, and the feedback vertex set number of a graph, $k$, is the size of a smallest feedback vertex set. We propose a DP algorithm with error rate $\tilde O(k)$.
A Simple Differentially Private Algorithm for Global Minimum Cut
在这篇文章中,我们提出了一个简单的差分私有算法的全球最小割问题,只使用一个调用的指数机制。这个问题首先由Gupta等人研究。[2010],他们给出了一个具有接近最优效用保证的差分私有算法。我们在许多方面改进了他们的工作:我们的算法比Gupta et al. [2010]中给出的算法更简单,更自然,更有效,而且提供了更好的隐私和实用性保证。
Differentially Private Algorithms for Clustering with Stability Assumptions
Ben-Gurion University of the Negev(内盖夫本-古里安大学)
本文研究了在输入稳定性假设下的差分私有聚类问题。尽管关于差分隐私的研究越来越多,特别是关于差异隐私聚类的研究,但只有三项研究(Nissim et al. 2007,Wang et al. 2015,Huang et al. 2018)研究了私下聚类“好”k均值实例的问题,这三个都依赖于样本,聚合框架和所有三个测量实用程序在真正的集群中心和返回的中心之间的Wasserstein距离私有算法在这项工作中,我们改进了这一系列的多轴工作。我们提出了一个简单得多的算法聚类稳定的输入(不依赖于样本和聚合框架),并分析其效用的Wasserstein距离和k-means成本。此外,我们的算法有直接的类似物“好”的k-中位数的实例和本地模型的差分隐私。