Shortest Path Computation with No Information Leakage
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 socia...
Saved in:
Main Authors: | MOURATIDIS, Kyriakos, YIU, Man Lung |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2012
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1488 https://ink.library.smu.edu.sg/context/sis_research/article/2487/viewcontent/VLDB12_PIRsp.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Strong Location Privacy: A Case Study on Shortest Path Queries [Invited Paper]
by: MOURATIDIS, Kyriakos
Published: (2013) -
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Shortest Path Computation on Air Indexes
by: KELLARIS, Georgios, et al.
Published: (2010) -
Efficient navigation for constrained shortest path with adaptive expansion control
by: XIA, Wenwen, et al.
Published: (2022) -
Efficient Verification of Shortest Path Search Via Authenticated Hints
by: YIU, Man Lung, et al.
Published: (2010)