TY - GEN
T1 - A new grid-based cloaking algorithm for privacy protection in location-based services
AU - Um, Jungho
AU - Kim, Hyeongil
AU - Choi, Youngho
AU - Chang, Jaewoo
PY - 2009
Y1 - 2009
N2 - In Location-Based Services (LBSs), users send location-based queries to LBS servers along with their exact locations, but the location information of the users can be misused by adversaries. For this, a mechanism to deal with the users' privacy protection is required. In this paper, we propose a new cloaking algorithm for privacy protection in LBSs. Our cloaking algorithm can support both k-anonymity and l-diversity. That is, it first creates a minimum cloaking region by finding l buildings (l-diversity) and then finds k users (k-anonymity). To generate the minimum cloaking region efficiently, we make use of a grid structure for storing buildings and users as well as a pruning technique for reducing unnecessary computation. Finally, we show from our performance analysis that our cloaking algorithm outperforms the existing gridbased cloaking algorithm, in terms of the size of cloaking regions, their creation time and query processing time based on them.
AB - In Location-Based Services (LBSs), users send location-based queries to LBS servers along with their exact locations, but the location information of the users can be misused by adversaries. For this, a mechanism to deal with the users' privacy protection is required. In this paper, we propose a new cloaking algorithm for privacy protection in LBSs. Our cloaking algorithm can support both k-anonymity and l-diversity. That is, it first creates a minimum cloaking region by finding l buildings (l-diversity) and then finds k users (k-anonymity). To generate the minimum cloaking region efficiently, we make use of a grid structure for storing buildings and users as well as a pruning technique for reducing unnecessary computation. Finally, we show from our performance analysis that our cloaking algorithm outperforms the existing gridbased cloaking algorithm, in terms of the size of cloaking regions, their creation time and query processing time based on them.
UR - https://www.scopus.com/pages/publications/70449566801
U2 - 10.1109/HPCC.2009.47
DO - 10.1109/HPCC.2009.47
M3 - Conference paper
AN - SCOPUS:70449566801
SN - 9780769537382
T3 - 2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009
SP - 362
EP - 368
BT - 2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009
T2 - 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009
Y2 - 25 June 2009 through 27 June 2009
ER -