Name
Abstract | ||
|---|---|---|
Privacy protection is critical for Location-Based Services (LBSs). In most previous solutions, users query service data from the untrusted LBS server when needed, and discard the data immediately after use. However, the data can be cached and reused to answer future queries. This prevents some queries from being sent to the LBS server and thus improves privacy. Although a few previous works recognize the usefulness of caching for better privacy, they use caching in a pretty straightforward way, and do not show the quantitative relation between caching and privacy. In this paper, we propose a caching-based solution to protect location privacy in LBSs, and rigorously explore how much caching can be used to improve privacy. Specifically, we propose an entropy-based privacy metric which for the first time incorporates the effect of caching on privacy. Then we design two novel caching-aware dummy selection algorithms which enhance location privacy through maximizing both the privacy of the current query and the dummies' contribution to cache. Evaluations show that our algorithms provide much better privacy than previous caching-oblivious and caching-aware solutions. |
Year | Venue | Field |
|---|---|---|
2015 | 2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM) | Computer science,Cache,Location-based service,Computer network,Pound (mass),Privacy software |
DocType | ISSN | Citations |
Conference | 0743-166X | 31 |
PageRank | References | Authors |
0.84 | 28 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ben Niu | 1 | 249 | 22.20 |
| Qing-Hua Li | 2 | 1563 | 88.15 |
| Xiaoyan Zhu | 3 | 2125 | 141.16 |
| Guohong Cao | 4 | 6690 | 326.81 |
| Hui Li | 5 | 394 | 35.42 |