回到绘图板:重新审视最佳位置隐私保护机制的设计
Back to the Drawing Board: Revisiting the Design of Optimal Location Privacy-preserving Mechanisms
摘要:
在过去的几年里,我们已经目睹了各种策略的外观设计最佳位置隐私保护机制,在最大限度地提高对手的预期误差方面的用户的行踪。在这项工作中,我们仔细研究了这些策略所创建的防御,并表明,即使他们确实是最佳的对手的正确性方面,并不是所有的人都提供相同的保护时,在其他方面的隐私。为了避免“坏”的选择,我们认为,最佳机制的搜索必须以互补的标准为指导。我们提供了两个示例辅助度量,在这方面有所帮助:条件熵,捕获问题的信息理论方面;和最坏情况下的质量损失,确保该机制的输出始终为用户提供最小的效用。我们描述了一种新的机制,最大限度地提高了条件熵,是最佳的平均对手的错误,并比较其性能与以前提出的最佳机制,使用两个真实的数据集。我们的实证结果证实,没有机制票价以及每个隐私标准同时,显然需要考虑多个隐私维度有一个很好的理解的隐私保护的机制提供。
英文摘要:
In the last years we have witnessed the appearance of a variety of strategies to design optimal location privacy-preserving mechanisms, in terms of maximizing the adversary's expected error with respect to the users' whereabouts. In this work, we take a closer look at the defenses created by these strategies and show that, even though they are indeed optimal in terms of adversary's correctness, not all of them offer the same protection when looking at other dimensions of privacy. To avoid "bad" choices, we argue that the search for optimal mechanisms must be guided by complementary criteria. We provide two example auxiliary metrics that help in this regard: the conditional entropy, that captures an information-theoretic aspect of the problem; and the worst-case quality loss, that ensures that the output of the mechanism always provides a minimum utility to the users. We describe a new mechanism that maximizes the conditional entropy and is optimal in terms of average adversary error, and compare its performance with previously proposed optimal mechanisms using two real datasets. Our empirical results confirm that no mechanism fares well on every privacy criteria simultaneously, making apparent the need for considering multiple privacy dimensions to have a good understanding of the privacy protection a mechanism provides.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。