By Topic

A New Cloaking Method Supporting both K-anonymity and L-diversity for Privacy Protection in Location-Based Service

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jung-Ho Um ; Dept. of Comput. Eng., Chonbuk Nat. Univ., Chonju, South Korea ; Mi-Young Jang ; Kyoung-Jin Jo ; Jae-Woo Chan

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. In this regard, there must be a mechanism which can deal with the privacy protection of the users. In this paper, we propose a cloaking method considering both K-anonymity and L-diversity. Our cloaking method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finds K number of users (K-anonymity). To support it, we use R*-tree based index structures as well as efficient filtering techniques to generate a minimum cloaking region. Finally, we show from our performance analysis that our cloaking method outperforms the existing grid-based cloaking method in terms of the size of cloaking regions and cloaking region creation time.

Published in:

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications

Date of Conference:

10-12 Aug. 2009