期刊
出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2660267.2660345
关键词
Location privacy; Location obfuscation; Geo-indistinguishability; Differential privacy; Linear optimization
资金
- MSR-INRIA joint lab
- European Union 7th FP project MEALS
- INRIA Large Scale Initiative CAPPRIS
- DGA
- [ANR-12-IS02-001 PACE]
We consider the geo-indistinguishability approach to location privacy, and the trade-off with respect to utility. We show that, given a desired degree of geo-indistinguishability, it is possible to construct a mechanism that minimizes the service quality loss, using linear programming techniques. In addition we show that, under certain conditions, such mechanism also provides optimal privacy in the sense of Shokri et al. Furthermore, we propose a method to reduce the number of constraints of the linear program from cubic to quadratic, maintaining the privacy guarantees and without affecting significantly the utility of the generated mechanism. This reduces considerably the time required to solve the linear program, thus enlarging significantly the location sets for which the optimal mechanisms can be computed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据