arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.14247cs.DS
收藏

差分私有图距离释放中的线性误差障碍突破

Breaking the Linear Error Barrier in Differentially Private Graph Distance Release

Chenglin Fan, Ping Li, Xiaoyun Li

摘要:

在加权差分隐私(DP)下释放一般图上顶点之间的所有成对最短路径(APSP)距离是一项具有挑战性的任务。在(Sealfon 2016)的先前尝试中,通过将拉普拉斯噪声添加到每个边权重或每个输出距离,以实现具有某个固定预算的DP,所有公布的成对距离中的最大绝对误差很可能大致为$O(n)$,其中$n$是节点的数量。结果表明,对于某些特殊的图,这种误差是可以减小的,而对于一般的图,这是困难的。因此,在$n$中,近似误差是否可以降低到次线性是一个有趣的公开问题。通过提出一种秘密释放合成图的算法,打破了已有结果在距离逼近误差上的线性障碍。在构造的图上计算所有成对距离仅在回答固定隐私参数的所有成对最短路径距离时引入$\tilde O(n^{1/2})$错误。我们的方法是基于一种新的图形直径(链接长度)扩增通过构建“捷径”的路径。通过在原图中添加一组捷径边,证明了任意节点对都有一条链路长度为$\tilde O(n^{1/2})$的最短路径。然后,通过添加噪声与一些积极的意思,边的权重,我们表明,新的图是差分私有的,可以发布回答所有的成对最短路径距离与$\tilde O(n^{1/2})$近似误差使用标准的APSP计算。此外,我们考虑了具有小反馈点集的图。图的反馈点集(FVS)是指去掉这些点后图中没有圈的点的集合,图的反馈点集数$k$是最小反馈点集的大小.提出了一种具有出错率$\tilde O(k)$的DP算法。

英文摘要:

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)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑