Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Databases and Information Systems
Strong Location Privacy: A Case Study On Shortest Path Queries [Invited Paper], Kyriakos Mouratidis
Strong Location Privacy: A Case Study On Shortest Path Queries [Invited Paper], Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
The last few years have witnessed an increasing availability of location-based services (LBSs). Although particularly useful, such services raise serious privacy concerns. For example, exposing to a (potentially untrusted) LBS the client's position may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. There is a large body of work on protecting the location privacy of the clients. In this paper, we focus on shortest path queries, describe a framework based on private information retrieval (PIR), and conclude with open questions about the practicality of PIR and other location privacy approaches.
Shortest Path Computation With No Information Leakage, Kyriakos Mouratidis, Man Lung Yiu
Shortest Path Computation With No Information Leakage, Kyriakos Mouratidis, Man Lung Yiu
Research Collection School Of Computing and Information Systems
Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client’s position and her destination may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. The only existing method for privacy-preserving shortest path computation follows the obfuscation paradigm; it prevents the LBS from inferring the source and destination of the query with a probability higher than a threshold. This implies, however, that the LBS still deduces some information (albeit not exact) about the client’s location …