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

论差分隐私与定量信息流的关系

On the relation between Differential Privacy and Quantitative Information Flow

Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Catuscia Palamidessi

摘要:

差分隐私是在统计数据库社区中出现的一个概念,作为对在执行统计查询时保护数据库参与者的隐私问题的回应。其思想是,如果获得数据库$x$的某个答案的可能性与在相邻数据库上获得相同答案的可能性没有太大差异,即,仅针对一个个体的数据库不同于$x$,则随机化查询满足差分隐私。信息流是一个安全领域,涉及控制程序和协议中机密信息的泄漏问题。如今,量化和推理泄漏的最成熟的方法之一是基于信息论的雷尼最小熵版本。在本文中,我们批判性地分析了差分隐私的概念,由雷尼敏信息论提供的概念框架。我们发现,有一个密切的联系之间的差分隐私和泄漏,由于图的对称性诱导的邻接关系。此外,我们考虑了随机答案的效用,它衡量了其预期的准确度。我们专注于某些类型的效用函数称为“二进制”,这与雷尼min互信息有密切的对应关系。同样,事实证明,差分隐私和效用之间可能存在紧密的对应关系,这取决于由邻接关系和查询引起的对称性。根据这些对称性,我们还可以建立一个最优效用随机化机制,同时保持所需的差分隐私水平。我们的主要贡献是一种结构,可以诱导的邻接关系和查询,以及如何使用它们来推导出的泄漏的界限,并实现最佳效用的研究。

英文摘要:

Differential privacy is a notion that has emerged in the community of statistical databases, as a response to the problem of protecting the privacy of the database's participants when performing statistical queries. The idea is that a randomized query satisfies differential privacy if the likelihood of obtaining a certain answer for a database $x$ is not too different from the likelihood of obtaining the same answer on adjacent databases, i.e. databases which differ from $x$ for only one individual. Information flow is an area of Security concerned with the problem of controlling the leakage of confidential information in programs and protocols. Nowadays, one of the most established approaches to quantify and to reason about leakage is based on the Rényi min entropy version of information theory. In this paper, we analyze critically the notion of differential privacy in light of the conceptual framework provided by the Rényi min information theory. We show that there is a close relation between differential privacy and leakage, due to the graph symmetries induced by the adjacency relation. Furthermore, we consider the utility of the randomized answer, which measures its expected degree of accuracy. We focus on certain kinds of utility functions called "binary", which have a close correspondence with the Rényi min mutual information. Again, it turns out that there can be a tight correspondence between differential privacy and utility, depending on the symmetries induced by the adjacency relation and by the query. Depending on these symmetries we can also build an optimal-utility randomization mechanism while preserving the required level of differential privacy. Our main contribution is a study of the kind of structures that can be induced by the adjacency relation and the query, and how to use them to derive bounds on the leakage and achieve the optimal utility.

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

↑