Optimal Sporadic Location Privacy Preserving Systems in Presence of Bandwidth Constraints

Presenter: 
Michael Herrmann
Date: 
Thursday, March 19, 2015 - 23:59
Abstract: 

Various Location Privacy-Preserving Mechanisms (LPPMs) have been proposed in the literature to address the privacy risks derived from the exposure of user locations through the use of Location Based Services (LBSs). LPPMs obfuscate the locations disclosed to the LBS provider using a variety of strategies, which come at a cost either in terms of quality of service, or of resource consumption, or both. Shokri et al. propose an LPPM design framework that outputs optimal LPPM parameters considering a strategic adversary that knows the algorithm implemented by the LPPM, and has prior knowledge on the users' mobility profiles.
The framework allows users to set a constraint on the tolerable loss quality of service due to perturbations in the locations exposed by the LPPM. We observe that this constraint does not capture the fact that some LPPMs rely on techniques that augment the level of privacy by increasing resource consumption. In our work we extend Shokri et al.'s framework to account for constraints on bandwidth consumption. This allows us to evaluate and compare LPPMs that generate dummies queries or that decrease the precision of the disclosed locations. We study the trilateral trade-off between privacy, quality of service, and bandwidth, using real mobility data. Our results show that dummy-based LPPMs offer the best protection for a given combination of quality and bandwidth constraints, and that, as soon as communication overhead is permitted, both dummy-based and precision-based LPPMs outperform LPPMs that only perturb the exposed locations. We also observe that the maximum value of privacy a user can enjoy can be reached by either sufficiently relaxing the quality loss or the bandwidth constraints, or by choosing an adequate combination of both constraints. Our results contribute to a better understanding of the effectiveness of location privacy protection strategies, and to the design of LPPMs with constrained resource consumption.

Bio: 

Michael Herrmann is a PhD student at the Computer Security and Industrial Cryptography (COSIC) research group of the Department of Electrical Engineering (ESAT) at the KU Leuven. He holds a Master degree in Computer Science from Technische Universität München (Germany). His main research interests are in the protection of location data where he is particularly interested in the quantification of user privacy and designing privacy-preserving location-based services. He is furthermore interested in the interdisciplinary aspects of privacy, combining the technical, legal and ethical discipline. In the past he also did research on anonymous communication systems and privacy in web search.