arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1208.4586cs.CRcs.SIphysics.soc-ph
收藏

社交网络中基于受限敏感度的差异隐私数据分析

Differentially Private Data Analysis of Social Networks via Restricted Sensitivity

Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet

摘要:

我们引入了限制敏感性的概念,作为全局和平滑敏感性的替代方案,以提高差异隐私数据分析的准确性。受限敏感度的定义与全局敏感度的定义类似,不同之处在于,我们不是对所有可能的数据集进行量化,而是利用查询者可能拥有的关于数据集的任何信念来量化受限的一类数据集。具体来说,给定一个查询f和一个关于数据集D的结构的假设H,我们一般地展示了如何将f转换成一个新的查询f_H,其全局灵敏度(在所有数据集上,包括那些不满足H的数据集)匹配查询f的受限灵敏度。此外,如果查询者的信念是正确的(即,D在H中)则f_H(D)= f(D)。如果信念是不正确的,那么f_H(D)可能是不准确的。我们通过考虑回答关于社交网络的查询的任务来证明这个概念的有用性,我们将社交网络建模为图和其顶点的标签的组合。特别是,虽然我们的通用程序是计算效率低下,为特定的定义H的有界度的图形,我们展示了有效的方法,使用不同的投影为基础的技术来构建f_H。然后,我们分析了两个重要的查询类:子图计数查询(例如,三角形的数目)和局部简档查询(例如,一个间谍和一个计算机科学家互相认识的人数)。我们证明,这种查询的限制的敏感性可以显着低于其平滑的敏感性。因此,使用受限敏感度,我们可以保持隐私,无论D是否在H中,同时在H为真的情况下提供更准确的结果。

英文摘要:

We introduce the notion of restricted sensitivity as an alternative to global and smooth sensitivity to improve accuracy in differentially private data analysis. The definition of restricted sensitivity is similar to that of global sensitivity except that instead of quantifying over all possible datasets, we take advantage of any beliefs about the dataset that a querier may have, to quantify over a restricted class of datasets. Specifically, given a query f and a hypothesis H about the structure of a dataset D, we show generically how to transform f into a new query f_H whose global sensitivity (over all datasets including those that do not satisfy H) matches the restricted sensitivity of the query f. Moreover, if the belief of the querier is correct (i.e., D is in H) then f_H(D) = f(D). If the belief is incorrect, then f_H(D) may be inaccurate. We demonstrate the usefulness of this notion by considering the task of answering queries regarding social-networks, which we model as a combination of a graph and a labeling of its vertices. In particular, while our generic procedure is computationally inefficient, for the specific definition of H as graphs of bounded degree, we exhibit efficient ways of constructing f_H using different projection-based techniques. We then analyze two important query classes: subgraph counting queries (e.g., number of triangles) and local profile queries (e.g., number of people who know a spy and a computer-scientist who know each other). We demonstrate that the restricted sensitivity of such queries can be significantly lower than their smooth sensitivity. Thus, using restricted sensitivity we can maintain privacy whether or not D is in H, while providing more accurate results in the event that H holds true.

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

↑