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.
|Name||Proceedings of the ACM Conference on Computer and Communications Security|
|Conference||ACM conference on computer and communications security (21st : 2014)|
|Period||3/11/14 → 7/11/14|
- Location privacy
- Location obfuscation
- Differential privacy
- Linear optimization