Private proximity detection for convex polygons

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Proximity detection is an emerging technology in Geo-Social Networks that notifies mobile users when they are in proximity. Nevertheless, users may be unwilling to participate in such applications if they are required to disclose their exact locations to a centralized server and/or their social friends. To this end, private proximity detection protocols allow any two parties to test for proximity while maintaining their locations secret. In particular, a private proximity detection query returns only a boolean result to the querier and, in addition, it guarantees that no party can derive any information regarding the other party's location. However, most of the existing protocols rely on simple grid decompositions of the space and assume that two users are in proximity when they are located inside the same grid cell. In this paper, we extend the notion of private proximity detection, and propose a novel approach that allows a mobile user to define an arbitrary convex polygon on the map and test whether his friends are located therein. Our solution employs a secure two-party computation protocol and is provably secure. We implemented our method on handheld devices and illustrate its efficiency in terms of both computational and communication costs.

Original languageEnglish
Article number7488738
Pages (from-to)270-280
Number of pages11
JournalTsinghua Science and Technology
Volume21
Issue number3
DOIs
Publication statusPublished - 1 Jun 2016
Externally publishedYes

Fingerprint

Network protocols
Servers
Decomposition
Communication
Costs

Keywords

  • location privacy
  • proximity detection
  • secure computations

ASJC Scopus subject areas

  • General

Cite this

Private proximity detection for convex polygons. / Mu, Bin; Bakiras, Spiridon.

In: Tsinghua Science and Technology, Vol. 21, No. 3, 7488738, 01.06.2016, p. 270-280.

Research output: Contribution to journalArticle

@article{46439fbbad554a36b9b13615d0b61431,
title = "Private proximity detection for convex polygons",
abstract = "Proximity detection is an emerging technology in Geo-Social Networks that notifies mobile users when they are in proximity. Nevertheless, users may be unwilling to participate in such applications if they are required to disclose their exact locations to a centralized server and/or their social friends. To this end, private proximity detection protocols allow any two parties to test for proximity while maintaining their locations secret. In particular, a private proximity detection query returns only a boolean result to the querier and, in addition, it guarantees that no party can derive any information regarding the other party's location. However, most of the existing protocols rely on simple grid decompositions of the space and assume that two users are in proximity when they are located inside the same grid cell. In this paper, we extend the notion of private proximity detection, and propose a novel approach that allows a mobile user to define an arbitrary convex polygon on the map and test whether his friends are located therein. Our solution employs a secure two-party computation protocol and is provably secure. We implemented our method on handheld devices and illustrate its efficiency in terms of both computational and communication costs.",
keywords = "location privacy, proximity detection, secure computations",
author = "Bin Mu and Spiridon Bakiras",
year = "2016",
month = "6",
day = "1",
doi = "10.1109/TST.2016.7488738",
language = "English",
volume = "21",
pages = "270--280",
journal = "Tsinghua Science and Technology",
issn = "1007-0214",
publisher = "Tsing Hua University",
number = "3",

}

TY - JOUR

T1 - Private proximity detection for convex polygons

AU - Mu, Bin

AU - Bakiras, Spiridon

PY - 2016/6/1

Y1 - 2016/6/1

N2 - Proximity detection is an emerging technology in Geo-Social Networks that notifies mobile users when they are in proximity. Nevertheless, users may be unwilling to participate in such applications if they are required to disclose their exact locations to a centralized server and/or their social friends. To this end, private proximity detection protocols allow any two parties to test for proximity while maintaining their locations secret. In particular, a private proximity detection query returns only a boolean result to the querier and, in addition, it guarantees that no party can derive any information regarding the other party's location. However, most of the existing protocols rely on simple grid decompositions of the space and assume that two users are in proximity when they are located inside the same grid cell. In this paper, we extend the notion of private proximity detection, and propose a novel approach that allows a mobile user to define an arbitrary convex polygon on the map and test whether his friends are located therein. Our solution employs a secure two-party computation protocol and is provably secure. We implemented our method on handheld devices and illustrate its efficiency in terms of both computational and communication costs.

AB - Proximity detection is an emerging technology in Geo-Social Networks that notifies mobile users when they are in proximity. Nevertheless, users may be unwilling to participate in such applications if they are required to disclose their exact locations to a centralized server and/or their social friends. To this end, private proximity detection protocols allow any two parties to test for proximity while maintaining their locations secret. In particular, a private proximity detection query returns only a boolean result to the querier and, in addition, it guarantees that no party can derive any information regarding the other party's location. However, most of the existing protocols rely on simple grid decompositions of the space and assume that two users are in proximity when they are located inside the same grid cell. In this paper, we extend the notion of private proximity detection, and propose a novel approach that allows a mobile user to define an arbitrary convex polygon on the map and test whether his friends are located therein. Our solution employs a secure two-party computation protocol and is provably secure. We implemented our method on handheld devices and illustrate its efficiency in terms of both computational and communication costs.

KW - location privacy

KW - proximity detection

KW - secure computations

UR - http://www.scopus.com/inward/record.url?scp=84975226328&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84975226328&partnerID=8YFLogxK

U2 - 10.1109/TST.2016.7488738

DO - 10.1109/TST.2016.7488738

M3 - Article

VL - 21

SP - 270

EP - 280

JO - Tsinghua Science and Technology

JF - Tsinghua Science and Technology

SN - 1007-0214

IS - 3

M1 - 7488738

ER -