Nearby-Friend Discovery Protocol for Multiple Users

Author

Raizada, Shashwat ; Paul, Goutam ; Pandey, Vineet

Author_Institution

Appl. Stat. Unit, Indian Stat. Inst., Kolkata, India

Volume

3

fYear

2009

fDate

29-31 Aug. 2009

Firstpage

238

Lastpage

243

Abstract

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.

Keywords

data privacy; geometry; graph theory; mobile computing; protocols; telecommunication security; Euclidean plane geometry; graph theory; k-anonymity; location based service; location privacy; multiple users; nearby-friend discovery protocol; secure multiparty computation; Authentication; Computational geometry; Computer science; Context-aware services; Global Positioning System; Graph theory; Information systems; Privacy; Protocols; Statistics; $k$-anonymity; Location privacy; Multi-party Computation; Nearby-friend.;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Science and Engineering, 2009. CSE '09. International Conference on

Conference_Location

Vancouver, BC

Print_ISBN

978-1-4244-5334-4

Electronic_ISBN

978-0-7695-3823-5

Type

conf

DOI

10.1109/CSE.2009.114

Filename

5283564