{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T10:56:04Z","timestamp":1779879364370,"version":"3.53.1"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p>\n            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\n            <jats:italic>k<\/jats:italic>\n            nearest neighbor (\n            <jats:italic>k<\/jats:italic>\n            NN) queries and define the notion of\n            <jats:italic>strong location privacy<\/jats:italic>\n            , which renders a query\n            <jats:italic>indistinguishable<\/jats:italic>\n            from\n            <jats:italic>any<\/jats:italic>\n            location in the data space. We argue that previous work fails to support this property for arbitrary\n            <jats:italic>k<\/jats:italic>\n            NN search. Towards this end, we introduce methods that offer strong location privacy, by integrating\n            <jats:italic>private information retrieval<\/jats:italic>\n            (PIR) functionality. Specifically, we employ\n            <jats:italic>secure hardware-aided<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.14778\/1920841.1920920","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"619-629","source":"Crossref","is-referenced-by-count":114,"title":["Nearest neighbor search with strong location privacy"],"prefix":"10.14778","volume":"3","author":[{"given":"Stavros","family":"Papadopoulos","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spiridon","family":"Bakiras","sequence":"additional","affiliation":[{"name":"City University of New York"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Tor: anonymity online. http:\/\/www.torproject.org\/.  Tor: anonymity online. http:\/\/www.torproject.org\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007632"},{"key":"e_1_2_1_3_1","volume-title":"FOCS","author":"Beimel A.","year":"2002"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11957454_23"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796270"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"M. de Berg M. van Kreveld M. Overmars and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag 2nd edition 2000.  M. de Berg M. van Kreveld M. Overmars and O. Schwarzkopf. Computational Geometry: Algorithms and Applications . Springer-Verlag 2nd edition 2000.","DOI":"10.1007\/978-3-662-04245-8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11428572_10"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11556114_3"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.48"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_65"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376631"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242623"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.15"},{"key":"e_1_2_1_14_1","unstructured":"A. Iliev and S. Smith. Private information storage with logarithmic-space secure hardware. In i-NetSec 2004.  A. Iliev and S. Smith. Private information storage with logarithmic-space secure hardware. In i-NetSec 2004."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190662"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1784462.1784476"},{"key":"e_1_2_1_17_1","volume-title":"KAIS","author":"Khoshgozaran A.","year":"2010"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERSER.2005.1506394"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796363"},{"key":"e_1_2_1_20_1","volume-title":"VLDB","author":"Mokbel M. F.","year":"2006"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066230"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_4"},{"key":"e_1_2_1_24_1","volume-title":"NDSS","author":"Williams P.","year":"2008"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497445"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:53:18Z","timestamp":1672228398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920920"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920920","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}