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

Nearby-Friend Discovery Protocol for Multiple Users

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

3 Author(s)
Raizada, Shashwat ; Appl. Stat. Unit, Indian Stat. Inst., Kolkata, India ; Paul, G. ; Pandey, V.

The nearby-friend problem for a user in the context of location based services is to learn the location of a nearby-friend only if (s)he is actually nearby, while simultaneously maintaining the privacy of their respective locations. The existing works address the problem for two users only. In this paper, we present for the first time a solution which caters to multiple users. We use techniques from Euclidean plane geometry and graph theory to develop a secure multi-party computation approach towards solving the nearby-friend problem efficiently for many users. Our solution ensures users' location privacy by enforcing k-anonymity.

Published in:

Computational Science and Engineering, 2009. CSE '09. International Conference on  (Volume:3 )

Date of Conference:

29-31 Aug. 2009

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.