Abstract
With the growing use of location-Based services, location privacy attracts increasing attention from users, industry, and the research community. While considerable effort has been devoted to inventing techniques that prevent service providers from knowing a user's exact location, relatively little attention has been paid to enabling so-called peer-wise privacy-the protection of a user's location from unauthorized peer users. This paper identifies an important efficiency problem in existing peer-privacy approaches that simply apply a filtering step to identify users that are located in a query range, but that do not want to disclose their location to the querying peer. to solve this problem, we propose a novel, privacy-policy enabled index called the PEB-tree that seamlessly integrates location proximity and policy compatibility. We propose efficient algorithms that use the PEB-tree for processing privacy-aware range and kNN queries. Extensive experiments suggest that the PEB-tree enables efficient query processing. © 2011 VLDB Endowment.
Recommended Citation
D. Lin et al., "A Moving-object Index for Efficient Query Processing with Peer-wise Location Privacy," Proceedings of the VLDB Endowment, vol. 5, no. 1, pp. 37 - 48, VLDB Endowment, Jan 2011.
The definitive version is available at https://doi.org/10.14778/2047485.2047489
Department(s)
Computer Science
International Standard Serial Number (ISSN)
2150-8097
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 VLDB Endowment, All rights reserved.
Publication Date
01 Jan 2011
