Toward collective privacy using coordinative path planning

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the increasing importance of location based services in people's daily lives, location related privacy becomes a critical issue. Most of the current solutions protect users' privacy by cloaking users' exact positions when they invoke requests on the location based service. In this paper, we tackle the location privacy problem in navigation applications in a different way. Based on the trusted third-party architecture and the k-anonymity criterion, we propose a coordinative path planning algorithm for collective privacy. The novelty resides on two folds. One fold is from the predication perspective rather than the current solutions' focusing on on-site users. A user would be recommended a privacy-preserving path when he sends a navigation request. Another fold is by intentionally collective privacy rather than the traditionally independent calculation. The planned path for each user would be adjusted such that a set of users could be provided more privacy without degrading each user's privacy. To evaluate the proposed solution, we perform a set of experiments on both synthesis data and practical data. The experimental results show the efficiency and effectiveness of our method. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Xu, H., & Sun, Y. (2014). Toward collective privacy using coordinative path planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8351 LNCS, pp. 698–710). Springer Verlag. https://doi.org/10.1007/978-3-319-09265-2_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free