Cart (Loading....) | Create Account
Close category search window
 

Privacy Preserving Group Nearest Neighbour Queries in Location-Based Services Using Cryptographic Techniques

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
$31 $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

2 Author(s)
Yan Huang ; Dept. of Comput. Sci. & Eng., Univ. of North Texas, Denton, TX, USA ; Vishwanathan, R.

Location-based services (LBS) are available on a variety of mobile platforms like cellphones, PDA''s, etc. and an increasing number of users subscribe to and use these services. One of the basic privacy issues with LBS is that a user may not necessarily want to disclose their own location whenever they inquire about the location of places of interest to them e.g., nearest gas station, restaurant etc. The privacy aspect of LBS has received attention recently with a number of privacy-preserving methodologies being proposed for the client-server model where a querying client requests a location-based server to return some location that is of interest to it without revealing its own location to the server. In this paper, we consider privacy issues in the peer-to-peer model of LBS, where a group of users jointly compute a common location of interest to them such as a restaurant where they could all meet. In such scenarios, all peers in the group would like to jointly find a common location but might not want to reveal their individual locations to each other due to trust issues. We model this problem in the secure multi-party computation framework of cryptography and present a solution where all the peers can jointly compute a common location without the need for any user to reveal its individual location to anyone else. To this end, we present two privacy-preserving models and experimentally evaluate the performance of each of them.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.