arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.14756cs.DScs.CR
收藏

持续观察下图表的差分隐私算法

Differentially Private Algorithms for Graphs Under Continual Observation

University of Vienna(维也纳大学)

Hendrik Fichtenberger, Monika Henzinger, Lara Ost

AI总结:

本文研究持续观察下图问题的差分隐私动态图算法,针对三角形计数等计数问题将事件级加性误差改进为关于更新序列长度的多对数级别,并为最小生成树、最小割、最稠密子图和最大匹配等给出事件级隐私算法,同时证明用户级隐私下加性误差必须与输出值域成线性关系。

摘要:

差分隐私算法通过确保用户在数据中的存在与分析结果之间仅存在弱相关性,来保护数据分析场景中的个体。动态图算法在演化的输入上维护问题的解(例如匹配),即节点或边随时间插入或删除的图。它们在每次更新操作后连续地输出解的值。我们研究持续观察下图问题的(事件级和用户级)差分隐私算法,即差分隐私动态图算法。我们针对部分动态的基于计数的问题(如三角形计数)提出了事件级隐私算法,将加性误差在现有技术水平上改进了多项式因子(相对于更新序列长度 $T$),从而得到首个加性误差为 $T$ 的多对数级别的算法。我们还针对最小生成树、最小割、最稠密子图和最大匹配给出了 $\varepsilon$-差分隐私且部分动态的算法。我们改进的 MST 算法的加性误差为 $O(W \log^{3/2}T / \varepsilon)$,其中 $W$ 是任意边的最大权重,并且我们证明该误差在相差一个 $(\sqrt{\log T} / \varepsilon)$ 因子的意义下是紧的。对于其他问题,我们提出了一个部分动态算法,对任意常数 $β> 0$ 具有乘法误差 $(1+β)$,加性误差为 $O(W \log(nW) \log(T) / (\varepsilon β))$。最后,我们证明对于具有用户级隐私的广泛一类动态图算法,其加性误差必须与输出解值域的大小成线性关系。

英文摘要:

Differentially private algorithms protect individuals in data analysis scenarios by ensuring that there is only a weak correlation between the existence of the user in the data and the result of the analysis. Dynamic graph algorithms maintain the solution to a problem (e.g., a matching) on an evolving input, i.e., a graph where nodes or edges are inserted or deleted over time. They output the value of the solution after each update operation, i.e., continuously. We study (event-level and user-level) differentially private algorithms for graph problems under continual observation, i.e., differentially private dynamic graph algorithms. We present event-level private algorithms for partially dynamic counting-based problems such as triangle count that improve the additive error by a polynomial factor (in the length $T$ of the update sequence) on the state of the art, resulting in the first algorithms with additive error polylogarithmic in $T$. We also give $\varepsilon$-differentially private and partially dynamic algorithms for minimum spanning tree, minimum cut, densest subgraph, and maximum matching. The additive error of our improved MST algorithm is $O(W \log^{3/2}T / \varepsilon)$, where $W$ is the maximum weight of any edge, which, as we show, is tight up to a $(\sqrt{\log T} / \varepsilon)$-factor. For the other problems, we present a partially-dynamic algorithm with multiplicative error $(1+β)$ for any constant $β> 0$ and additive error $O(W \log(nW) \log(T) / (\varepsilon β))$. Finally, we show that the additive error for a broad class of dynamic graph algorithms with user-level privacy must be linear in the value of the output solution's range.

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

↑