An efficient method for privacy preserving location queries
Recently, the issue of privacy preserving location queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location...
Saved in:
| Published in | Frontiers of Computer Science Vol. 6; no. 4; pp. 409 - 420 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Heidelberg
Higher Education Press
01.08.2012
SP Higher Education Press Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1673-7350 2095-2228 1673-7466 2095-2236 |
| DOI | 10.1007/s11704-012-2838-8 |
Cover
| Summary: | Recently, the issue of privacy preserving location queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location query (PLQ), an efficient privacy preserving location query processing framework. This framework can enable the location-based query without revealing user location information. The framework can also facilitate location-based service providers to collect some information about the location based query, which is useful in practice. PLQ consists of three key components, namely, the location anonymizer at the client side, the privacy query processor at the server side, and an additional trusted third party connecting the client and server. The location anonymizer blurs the user location into a cloaked area based on a map-hierarchy. The map-hierarchy contains accurate regions that are partitioned according to real landforms. The privacy query processor deals with the requested nearest-neighbor (NN) location based query. A new convex hull of polygon (CHP) algorithm is proposed for nearest-neighbor queries using a polygon cloaked area. The experimental results show that our algorithms can efficiently process location based queries. |
|---|---|
| Bibliography: | location based service （LBS）, privacy preserva- tion, nearest-neighbor （NN） location query Recently, the issue of privacy preserving loca- tion queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location query （PLQ）, an efficient privacy pre-serving location query processing framework. This frame- work can enable the location-based query without revealing user location information. The framework can also facilitate location-based service providers to collect some information about the location based query, which is useful in practice. PLQ consists of three key components, namely, the location anonymizer at the client side, the privacy query processor at the server side, and an additional trusted third party connect- ing the client and server. The location anonymizer blurs the user location into a cloaked area based on a map-hierarchy. The map-hierarchy contains accurate regions that are parti- tioned according to real landforms. The privacy query pro- cessor deals with the requested nearest-neighbor （NN） loca- tion based query. A new convex hull of polygon （CHP） algo- rithm is proposed for nearest-neighbor queries using a poly- gon cloaked area. The experimental results show that our al- gorithms can efficiently process location based queries. 11-5731/TP Document accepted on :2011-11-30 Document received on :2011-04-19 privacy preservation location based service (LBS) nearest-neighbor (NN) location query ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1673-7350 2095-2228 1673-7466 2095-2236 |
| DOI: | 10.1007/s11704-012-2838-8 |