地理图不变性:基于差分隐私的道路网络位置隐私
Geo-Graph-Indistinguishability: Location Privacy on Road Networks Based on Differential Privacy
摘要:
近年来,随着基于位置的服务(LBS)的普及,人们对位置隐私的担忧日益增加。在过去的几十年里,已经提出了许多保护位置隐私的方法。特别是基于Geo-I的扰动方法,它将真实位置随机扰动为伪位置,由于继承了差分隐私的强隐私保证而受到关注。然而,Geo-I基于欧几里德平面,即使许多LBS基于道路网络(例如,乘车共享服务)。这导致了不必要的噪声,因此在道路网络上的LBS的实用性和隐私性之间的权衡不足。为了解决这个问题,我们提出了一个新的隐私概念,地理图不可侵犯性(GG-I),道路网络上的位置,以实现更好的权衡。我们提出了图指数机制(GEM),它满足GG-I。此外,我们形式化的优化问题,以找到最佳的创业板的权衡。然而,计算复杂性的一个天真的方法来找到最佳的解决方案是禁止的,所以我们提出了一个贪心算法找到一个近似的解决方案,在可接受的时间。最后,我们的实验表明,我们提出的机制优于Geo-I的机制的权衡。
英文摘要:
In recent years, concerns about location privacy are increasing with the spread of location-based services (LBSs). Many methods to protect location privacy have been proposed in the past decades. Especially, perturbation methods based on Geo-Indistinguishability (Geo-I), which randomly perturb a true location to a pseudolocation, are getting attention due to its strong privacy guarantee inherited from differential privacy. However, Geo-I is based on the Euclidean plane even though many LBSs are based on road networks (e.g. ride-sharing services). This causes unnecessary noise and thus an insufficient tradeoff between utility and privacy for LBSs on road networks. To address this issue, we propose a new privacy notion, Geo-Graph-Indistinguishability (GG-I), for locations on a road network to achieve a better tradeoff. We propose Graph-Exponential Mechanism (GEM), which satisfies GG-I. Moreover, we formalize the optimization problem to find the optimal GEM in terms of the tradeoff. However, the computational complexity of a naive method to find the optimal solution is prohibitive, so we propose a greedy algorithm to find an approximate solution in an acceptable amount of time. Finally, our experiments show that our proposed mechanism outperforms a Geo-I's mechanism with respect to the tradeoff.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。