By Topic

A New K-NN Query Processing Algorithm Enhancing Privacy Protection in Location-Based Services

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

3 Author(s)
Mi Young Jang ; Dept. of Comput. Eng., Chonbuk Nat. Univ., Jeonju, South Korea ; Sung-Jae Jang ; Jae-Woo Chang

Location-Based Services (LBSs) are becoming popular due to the advances in mobile networks and positioning capabilities. When a user sends a query with his exact location to the LBS server, the server processes the query and returns Points of Interest (POIs) to the user. Providing user's exact location to the LBS server may lead revealing his private information to unauthorized parties (e.g., adversaries). There exist two main fields of research to overcome this problem. They are cloaking region based query processing method which blurs a user's location into a cloaking region and Private Information Retrieval (PIR) based query processing methods which encrypt location data by using PIR protocol. However, they suffer from high computation and communication overheads. To resolve these problems, we, in this paper, propose a hybrid scheme to process an approximate k-Nearest Neighbor (k-NN) query by combining above two methods. Through performance analysis, we have shown that our hybrid scheme outperforms the existing work in terms of both query processing time and accuracy of the result set.

Published in:

2012 IEEE First International Conference on Mobile Services

Date of Conference:

24-29 June 2012