Space partitioning for privacy in location-based services continuous nearest neighbor query

With the help of location-aware mobile device user can issue a query and obtain information on nearest point of interest as it moves within a spatial network. This evolving computing paradigm offers great level of convenience to information access and usage. Nevertheless, the convenience comes with a price in the form of exposing user private information to potential abuse and misuse. This paper proposes a novel idea to protect user private information in a location-based services continuous nearest neighbor query with a focus on moving query and static object. Most proposed solutions for privacy use third party anonymizer, or offer protection only for snapshot query, however most queries are continuous. In this proposal we combine Voronoi tessellation and Hilbert curve order with R-tree index of geometric data storage to provide transition points that indicate where nearest neighbor changes. With a database arranged as a square matrix of size n bits, we execute double private information retrieval protocol in the server to return exact nearest neighbor point of interest throughout the query segment with minimal cost, and without revealing any user private information. Our experimental evaluation of the transmission cost using ns-3 simulator and the complexity analysis show a system capable of being scaled to different population size with minimal performance impact and with improvement on the complexity over related technique.