Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

2012

Shortest path

Articles 1 - 1 of 1

Full-Text Articles in Databases and Information Systems

Shortest Path Computation With No Information Leakage, Kyriakos Mouratidis, Man Lung Yiu Aug 2012

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 …