Private proximity detection for convex polygons

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 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 cost.

Original languageEnglish
Title of host publication12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013
Pages36-43
Number of pages8
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013 - New York, NY, United States
Duration: 23 Jun 201323 Jun 2013

Other

Other12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013
CountryUnited States
CityNew York, NY
Period23/6/1323/6/13

Fingerprint

Network protocols
Servers
Decomposition
Communication
Costs

Keywords

  • Location privacy
  • Proximity detection
  • Secure computations

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Mu, B., & Bakiras, S. (2013). Private proximity detection for convex polygons. In 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013 (pp. 36-43) https://doi.org/10.1145/2486084.2486087

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

12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013. 2013. p. 36-43.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mu, B & Bakiras, S 2013, Private proximity detection for convex polygons. in 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013. pp. 36-43, 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013, New York, NY, United States, 23/6/13. https://doi.org/10.1145/2486084.2486087
Mu B, Bakiras S. Private proximity detection for convex polygons. In 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013. 2013. p. 36-43 https://doi.org/10.1145/2486084.2486087
Mu, Bin ; Bakiras, Spiridon. / Private proximity detection for convex polygons. 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013. 2013. pp. 36-43
@inproceedings{3f55b14af8744957a79c06e9f7a29a95,
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 cost.",
keywords = "Location privacy, Proximity detection, Secure computations",
author = "Bin Mu and Spiridon Bakiras",
year = "2013",
doi = "10.1145/2486084.2486087",
language = "English",
isbn = "9781450321976",
pages = "36--43",
booktitle = "12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013",

}

TY - GEN

T1 - Private proximity detection for convex polygons

AU - Mu, Bin

AU - Bakiras, Spiridon

PY - 2013

Y1 - 2013

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 cost.

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 cost.

KW - Location privacy

KW - Proximity detection

KW - Secure computations

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

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

U2 - 10.1145/2486084.2486087

DO - 10.1145/2486084.2486087

M3 - Conference contribution

SN - 9781450321976

SP - 36

EP - 43

BT - 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, MobiDE 2013 - In Conjunction with the ACM SIGMOD/PODS 2013

ER -