Query-aware location anonymization for road networks

Chi Yin Chow, Mohamed Mokbel, Jie Bao, Xuan Liu

Research output: Contribution to journalArticle

48 Citations (Scopus)

Abstract

Recently, several techniques have been proposed to protect the user location privacy for location-based services in the Euclidean space. Applying these techniques directly to the road network environment would lead to privacy leakage and inefficient query processing. In this paper, we propose a new location anonymization algorithm that is designed specifically for the road network environment. Our algorithm relies on the commonly used concept of spatial cloaking, where a user location is cloaked into a set of connected road segments of a minimum total length K users. Our algorithm is "query-aware" as it takes into account the query execution cost at a database server and the query quality, i. e., the number of objects returned to users by the database server, during the location anonymization process. In particular, we develop a new cost function that balances between the query execution cost and the query quality. Then, we introduce two versions of our algorithm, namely, pure greedy and randomized greedy, that aim to minimize the developed cost function and satisfy the user specified privacy requirements. To accommodate intervals with a high workload, we introduce a shared execution paradigm that boosts the scalability of our location anonymization algorithm and the database server to support large numbers of queries received in a short time period. Extensive experimental results show that our algorithms are more efficient and scalable than the state-of-the-art technique, in terms of both query execution cost and query quality. The results also show that our algorithms have very strong resilience to two privacy attacks, namely, the replay attack and the center-of-cloaked-area attack.

Original languageEnglish
Pages (from-to)571-607
Number of pages37
JournalGeoInformatica
Volume15
Issue number3
DOIs
Publication statusPublished - 1 Jul 2011
Externally publishedYes

Fingerprint

road network
privacy
costs
cost
Servers
Cost functions
Costs
Location based services
Query processing
workload
resilience
leakage
Scalability
road
paradigm

Keywords

  • GIS
  • Location privacy
  • Location-based services
  • Shared execution
  • Spatial network databases

ASJC Scopus subject areas

  • Information Systems
  • Geography, Planning and Development

Cite this

Query-aware location anonymization for road networks. / Chow, Chi Yin; Mokbel, Mohamed; Bao, Jie; Liu, Xuan.

In: GeoInformatica, Vol. 15, No. 3, 01.07.2011, p. 571-607.

Research output: Contribution to journalArticle

Chow, Chi Yin ; Mokbel, Mohamed ; Bao, Jie ; Liu, Xuan. / Query-aware location anonymization for road networks. In: GeoInformatica. 2011 ; Vol. 15, No. 3. pp. 571-607.
@article{a3f489dedd0a40d9a5c1403d53ad69ca,
title = "Query-aware location anonymization for road networks",
abstract = "Recently, several techniques have been proposed to protect the user location privacy for location-based services in the Euclidean space. Applying these techniques directly to the road network environment would lead to privacy leakage and inefficient query processing. In this paper, we propose a new location anonymization algorithm that is designed specifically for the road network environment. Our algorithm relies on the commonly used concept of spatial cloaking, where a user location is cloaked into a set of connected road segments of a minimum total length K users. Our algorithm is {"}query-aware{"} as it takes into account the query execution cost at a database server and the query quality, i. e., the number of objects returned to users by the database server, during the location anonymization process. In particular, we develop a new cost function that balances between the query execution cost and the query quality. Then, we introduce two versions of our algorithm, namely, pure greedy and randomized greedy, that aim to minimize the developed cost function and satisfy the user specified privacy requirements. To accommodate intervals with a high workload, we introduce a shared execution paradigm that boosts the scalability of our location anonymization algorithm and the database server to support large numbers of queries received in a short time period. Extensive experimental results show that our algorithms are more efficient and scalable than the state-of-the-art technique, in terms of both query execution cost and query quality. The results also show that our algorithms have very strong resilience to two privacy attacks, namely, the replay attack and the center-of-cloaked-area attack.",
keywords = "GIS, Location privacy, Location-based services, Shared execution, Spatial network databases",
author = "Chow, {Chi Yin} and Mohamed Mokbel and Jie Bao and Xuan Liu",
year = "2011",
month = "7",
day = "1",
doi = "10.1007/s10707-010-0117-0",
language = "English",
volume = "15",
pages = "571--607",
journal = "GeoInformatica",
issn = "1384-6175",
publisher = "Kluwer Academic Publishers",
number = "3",

}

TY - JOUR

T1 - Query-aware location anonymization for road networks

AU - Chow, Chi Yin

AU - Mokbel, Mohamed

AU - Bao, Jie

AU - Liu, Xuan

PY - 2011/7/1

Y1 - 2011/7/1

N2 - Recently, several techniques have been proposed to protect the user location privacy for location-based services in the Euclidean space. Applying these techniques directly to the road network environment would lead to privacy leakage and inefficient query processing. In this paper, we propose a new location anonymization algorithm that is designed specifically for the road network environment. Our algorithm relies on the commonly used concept of spatial cloaking, where a user location is cloaked into a set of connected road segments of a minimum total length K users. Our algorithm is "query-aware" as it takes into account the query execution cost at a database server and the query quality, i. e., the number of objects returned to users by the database server, during the location anonymization process. In particular, we develop a new cost function that balances between the query execution cost and the query quality. Then, we introduce two versions of our algorithm, namely, pure greedy and randomized greedy, that aim to minimize the developed cost function and satisfy the user specified privacy requirements. To accommodate intervals with a high workload, we introduce a shared execution paradigm that boosts the scalability of our location anonymization algorithm and the database server to support large numbers of queries received in a short time period. Extensive experimental results show that our algorithms are more efficient and scalable than the state-of-the-art technique, in terms of both query execution cost and query quality. The results also show that our algorithms have very strong resilience to two privacy attacks, namely, the replay attack and the center-of-cloaked-area attack.

AB - Recently, several techniques have been proposed to protect the user location privacy for location-based services in the Euclidean space. Applying these techniques directly to the road network environment would lead to privacy leakage and inefficient query processing. In this paper, we propose a new location anonymization algorithm that is designed specifically for the road network environment. Our algorithm relies on the commonly used concept of spatial cloaking, where a user location is cloaked into a set of connected road segments of a minimum total length K users. Our algorithm is "query-aware" as it takes into account the query execution cost at a database server and the query quality, i. e., the number of objects returned to users by the database server, during the location anonymization process. In particular, we develop a new cost function that balances between the query execution cost and the query quality. Then, we introduce two versions of our algorithm, namely, pure greedy and randomized greedy, that aim to minimize the developed cost function and satisfy the user specified privacy requirements. To accommodate intervals with a high workload, we introduce a shared execution paradigm that boosts the scalability of our location anonymization algorithm and the database server to support large numbers of queries received in a short time period. Extensive experimental results show that our algorithms are more efficient and scalable than the state-of-the-art technique, in terms of both query execution cost and query quality. The results also show that our algorithms have very strong resilience to two privacy attacks, namely, the replay attack and the center-of-cloaked-area attack.

KW - GIS

KW - Location privacy

KW - Location-based services

KW - Shared execution

KW - Spatial network databases

UR - http://www.scopus.com/inward/record.url?scp=79956300176&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79956300176&partnerID=8YFLogxK

U2 - 10.1007/s10707-010-0117-0

DO - 10.1007/s10707-010-0117-0

M3 - Article

VL - 15

SP - 571

EP - 607

JO - GeoInformatica

JF - GeoInformatica

SN - 1384-6175

IS - 3

ER -