Nearest neighbor search with strong location privacy

Stavros Papadopoulos, Spiridon Bakiras, Dimitris Papadias

Research output: Contribution to journalArticle

104 Citations (Scopus)

Abstract

The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial queries pose an additional threat to privacy because the location of a query may be sufficient to reveal sensitive information about the querier. In this paper we focus on k nearest neighbor (kNN) queries and define the notion of strong location privacy, which renders a query indistinguishable from any location in the data space. We argue that previous work fails to support this property for arbitrary kNN search. Towards this end, we introduce methods that offer strong location privacy, by integrating private information retrieval (PIR) functionality. Specifically, we employ secure hardware-aided PIR, which has been proven very efficient and is currently considered as a practical mechanism for PIR. Initially, we devise a benchmark solution building upon an existing PIR-based technique. Subsequently, we identify its drawbacks and present a novel scheme called AHG to tackle them. Finally, we demonstrate the performance superiority of AHG over our competitor, and its viability in applications demanding the highest level of privacy.

Original languageEnglish
Pages (from-to)619-629
Number of pages11
JournalProceedings of the VLDB Endowment
Volume3
Issue number1
Publication statusPublished - Sep 2010
Externally publishedYes

Fingerprint

Information retrieval
Internet
Hardware
Nearest neighbor search
Costs

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Nearest neighbor search with strong location privacy. / Papadopoulos, Stavros; Bakiras, Spiridon; Papadias, Dimitris.

In: Proceedings of the VLDB Endowment, Vol. 3, No. 1, 09.2010, p. 619-629.

Research output: Contribution to journalArticle

Papadopoulos, S, Bakiras, S & Papadias, D 2010, 'Nearest neighbor search with strong location privacy', Proceedings of the VLDB Endowment, vol. 3, no. 1, pp. 619-629.
Papadopoulos, Stavros ; Bakiras, Spiridon ; Papadias, Dimitris. / Nearest neighbor search with strong location privacy. In: Proceedings of the VLDB Endowment. 2010 ; Vol. 3, No. 1. pp. 619-629.
@article{1ee97d69b3194ff09444a7a4497e8b21,
title = "Nearest neighbor search with strong location privacy",
abstract = "The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial queries pose an additional threat to privacy because the location of a query may be sufficient to reveal sensitive information about the querier. In this paper we focus on k nearest neighbor (kNN) queries and define the notion of strong location privacy, which renders a query indistinguishable from any location in the data space. We argue that previous work fails to support this property for arbitrary kNN search. Towards this end, we introduce methods that offer strong location privacy, by integrating private information retrieval (PIR) functionality. Specifically, we employ secure hardware-aided PIR, which has been proven very efficient and is currently considered as a practical mechanism for PIR. Initially, we devise a benchmark solution building upon an existing PIR-based technique. Subsequently, we identify its drawbacks and present a novel scheme called AHG to tackle them. Finally, we demonstrate the performance superiority of AHG over our competitor, and its viability in applications demanding the highest level of privacy.",
author = "Stavros Papadopoulos and Spiridon Bakiras and Dimitris Papadias",
year = "2010",
month = "9",
language = "English",
volume = "3",
pages = "619--629",
journal = "Proceedings of the VLDB Endowment",
issn = "2150-8097",
publisher = "Very Large Data Base Endowment Inc.",
number = "1",

}

TY - JOUR

T1 - Nearest neighbor search with strong location privacy

AU - Papadopoulos, Stavros

AU - Bakiras, Spiridon

AU - Papadias, Dimitris

PY - 2010/9

Y1 - 2010/9

N2 - The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial queries pose an additional threat to privacy because the location of a query may be sufficient to reveal sensitive information about the querier. In this paper we focus on k nearest neighbor (kNN) queries and define the notion of strong location privacy, which renders a query indistinguishable from any location in the data space. We argue that previous work fails to support this property for arbitrary kNN search. Towards this end, we introduce methods that offer strong location privacy, by integrating private information retrieval (PIR) functionality. Specifically, we employ secure hardware-aided PIR, which has been proven very efficient and is currently considered as a practical mechanism for PIR. Initially, we devise a benchmark solution building upon an existing PIR-based technique. Subsequently, we identify its drawbacks and present a novel scheme called AHG to tackle them. Finally, we demonstrate the performance superiority of AHG over our competitor, and its viability in applications demanding the highest level of privacy.

AB - The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial queries pose an additional threat to privacy because the location of a query may be sufficient to reveal sensitive information about the querier. In this paper we focus on k nearest neighbor (kNN) queries and define the notion of strong location privacy, which renders a query indistinguishable from any location in the data space. We argue that previous work fails to support this property for arbitrary kNN search. Towards this end, we introduce methods that offer strong location privacy, by integrating private information retrieval (PIR) functionality. Specifically, we employ secure hardware-aided PIR, which has been proven very efficient and is currently considered as a practical mechanism for PIR. Initially, we devise a benchmark solution building upon an existing PIR-based technique. Subsequently, we identify its drawbacks and present a novel scheme called AHG to tackle them. Finally, we demonstrate the performance superiority of AHG over our competitor, and its viability in applications demanding the highest level of privacy.

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

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

M3 - Article

AN - SCOPUS:79955911586

VL - 3

SP - 619

EP - 629

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 1

ER -