Skip to main content
Erschienen in: GeoInformatica 4/2013

01.10.2013

Blind evaluation of location based queries using space transformation to preserve location privacy

verfasst von: Ali Khoshgozaran, Houtan Shirani-Mehr, Cyrus Shahabi

Erschienen in: GeoInformatica | Ausgabe 4/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper we propose a fundamental approach to perform the class of Range and Nearest Neighbor (NN) queries, the core class of spatial queries used in location-based services, without revealing any location information about the query in order to preserve users’ private location information. The idea behind our approach is to utilize the power of one-way transformations to map the space of all objects and queries to another space and resolve spatial queries blindly in the transformed space. Traditional encryption based techniques, solutions based on the theory of private information retrieval, or the recently proposed anonymity and cloaking based approaches cannot provide stringent privacy guarantees without incurring costly computation and/or communication overhead. In contrast, we propose efficient algorithms to evaluate KNN and range queries privately in the Hilbert transformed space. We also propose a dual curve query resolution technique which further reduces the costs of performing range and KNN queries using a single Hilbert curve. We experimentally evaluate the performance of our proposed range and KNN query processing techniques and verify the strong level of privacy achieved with acceptable computation and communication overhead.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
A cryptographic hash allows fast computation of a digest in the forward direction while making it infeasible to find the original message given the digest. Moreover, it is infeasible to find two different messages that share the same digest.
 
2
We use an efficient bitwise interleaving algorithm from [9] to compute the H-values for points of interest. Depending on the implementation, the cost of performing this operation varies between O(n) and O(n 2) where n is the number of bits required to represent a Hilbert value.
 
Literatur
1.
Zurück zum Zitat Asonov D (2004) Querying databases privately: a new approach to private information retrieval. Lecture notes in computer science, vol 3128. Springer Asonov D (2004) Querying databases privately: a new approach to private information retrieval. Lecture notes in computer science, vol 3128. Springer
2.
Zurück zum Zitat Beresford AR, Stajano F (2003) Location privacy in pervasive computing. IEEE Pervasive Computing 2(1):46–55CrossRef Beresford AR, Stajano F (2003) Location privacy in pervasive computing. IEEE Pervasive Computing 2(1):46–55CrossRef
3.
Zurück zum Zitat Bouganim L, Pucheral P (2002) Chip-secured data access: confidential data on untrusted servers. In: VLDB’02, pp 131–142 Bouganim L, Pucheral P (2002) Chip-secured data access: confidential data on untrusted servers. In: VLDB’02, pp 131–142
4.
Zurück zum Zitat Chien H-Y, Jan J-K, Tseng Y-M (2002) An efficient and practical solution to remote authentication: smart card. Comput Secur 21(4):372–375CrossRef Chien H-Y, Jan J-K, Tseng Y-M (2002) An efficient and practical solution to remote authentication: smart card. Comput Secur 21(4):372–375CrossRef
5.
Zurück zum Zitat Chor B, Kushilevitz E, Goldreich O, Sudan M (1998) Private information retrieval. J ACM 45(6):965–981CrossRef Chor B, Kushilevitz E, Goldreich O, Sudan M (1998) Private information retrieval. J ACM 45(6):965–981CrossRef
6.
Zurück zum Zitat Chung K-L, Tsai Y-H, Hu F-C (2000) Space-filling approach for fast window query on compressed images. IEEE Trans Image Process 9(12):2109–2116CrossRef Chung K-L, Tsai Y-H, Hu F-C (2000) Space-filling approach for fast window query on compressed images. IEEE Trans Image Process 9(12):2109–2116CrossRef
7.
Zurück zum Zitat Dingledine R, Mathewson N, Syverson PF (2004) Tor: the second-generation onion router. In: USENIX’04, pp 303–320 Dingledine R, Mathewson N, Syverson PF (2004) Tor: the second-generation onion router. In: USENIX’04, pp 303–320
8.
Zurück zum Zitat Faloutsos C, Jagadish H, Manolopoulos Y (1997) Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles. IEEE Trans Knowl Data Eng 9(3):373–383CrossRef Faloutsos C, Jagadish H, Manolopoulos Y (1997) Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles. IEEE Trans Knowl Data Eng 9(3):373–383CrossRef
9.
Zurück zum Zitat Faloutsos C, Roseman S (1989) Fractals for secondary key retrieval. In: PODS ’89: proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. New York, NY, USA, pp 247–252 Faloutsos C, Roseman S (1989) Fractals for secondary key retrieval. In: PODS ’89: proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. New York, NY, USA, pp 247–252
10.
Zurück zum Zitat Gedik B, Liu L (2005) A customizable k-anonymity model for protecting location privacy. In: International conference on distributed computing systems (ICDPS), Columbos, Ohio Gedik B, Liu L (2005) A customizable k-anonymity model for protecting location privacy. In: International conference on distributed computing systems (ICDPS), Columbos, Ohio
11.
Zurück zum Zitat Ghinita G, Kalnis P, Khoshgozaran A, Shahabi C, Tan K-L (2008) Private queries in location based services: anonymizers are not necessary. In: SIGMOD’08, Vancouver, Canada Ghinita G, Kalnis P, Khoshgozaran A, Shahabi C, Tan K-L (2008) Private queries in location based services: anonymizers are not necessary. In: SIGMOD’08, Vancouver, Canada
12.
Zurück zum Zitat Gruteser M, Grunwald D (2003) Anonymous usage of location-based services through spatial and temporal cloaking. In: MobiSys. USENIX Gruteser M, Grunwald D (2003) Anonymous usage of location-based services through spatial and temporal cloaking. In: MobiSys. USENIX
13.
Zurück zum Zitat Hilbert D (1891) Uber die stetige abbildung einer linie auf ein flachenstuck. Math Ann 38:459–460CrossRef Hilbert D (1891) Uber die stetige abbildung einer linie auf ein flachenstuck. Math Ann 38:459–460CrossRef
14.
Zurück zum Zitat Indyk P, Woodruff DP (2006) Polylogarithmic private approximations and efficient matching. In: Theory of cryptography, third theory of cryptography conference. New York, NY, USA, pp 245–264 Indyk P, Woodruff DP (2006) Polylogarithmic private approximations and efficient matching. In: Theory of cryptography, third theory of cryptography conference. New York, NY, USA, pp 245–264
15.
Zurück zum Zitat Jagadish HV (1990) Linear clustering of objects with multiple atributes. In: Proceedings of the 1990 ACM SIGMOD international conference on management of data. ACM Press, Atlantic City, NJ, pp 332–342CrossRef Jagadish HV (1990) Linear clustering of objects with multiple atributes. In: Proceedings of the 1990 ACM SIGMOD international conference on management of data. ACM Press, Atlantic City, NJ, pp 332–342CrossRef
16.
Zurück zum Zitat Jagadish HV (1997) Analysis of the Hilbert curve for representing two-dimensional space. Inf Process Lett 62(1):17–22CrossRef Jagadish HV (1997) Analysis of the Hilbert curve for representing two-dimensional space. Inf Process Lett 62(1):17–22CrossRef
17.
Zurück zum Zitat Kalnis P, Ghinita G, Mouratidis K, Papadias D (2006) Preserving anonymity in location based services. A Technical Report Kalnis P, Ghinita G, Mouratidis K, Papadias D (2006) Preserving anonymity in location based services. A Technical Report
18.
Zurück zum Zitat Khoshgozaran A, Shahabi C (2007) Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy. In: Advances in spatial and temporal databases, 10th international symposium, SSTD’07, 16–18 July, vol 4605. Boston, MA, USA, pp 239–257 Khoshgozaran A, Shahabi C (2007) Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy. In: Advances in spatial and temporal databases, 10th international symposium, SSTD’07, 16–18 July, vol 4605. Boston, MA, USA, pp 239–257
19.
Zurück zum Zitat Khoshgozaran A, Shahabi C, Shirani-Mehr H (2011) Location privacy: going beyond k-anonymity, cloaking and anonymizers. Knowl Inf Syst 26(3):435–465CrossRef Khoshgozaran A, Shahabi C, Shirani-Mehr H (2011) Location privacy: going beyond k-anonymity, cloaking and anonymizers. Knowl Inf Syst 26(3):435–465CrossRef
20.
Zurück zum Zitat Kushilevitz E, Ostrovsky R (1997) Replication is not needed: single database, computationally-private information retrieval. In: FOCS’97, pp 364–373 Kushilevitz E, Ostrovsky R (1997) Replication is not needed: single database, computationally-private information retrieval. In: FOCS’97, pp 364–373
21.
Zurück zum Zitat Lawder JK, King PJH (2001) Querying multi-dimensional data indexed using the Hilbert space-filling curve. SIGMOD Rec 30(1):19–24CrossRef Lawder JK, King PJH (2001) Querying multi-dimensional data indexed using the Hilbert space-filling curve. SIGMOD Rec 30(1):19–24CrossRef
22.
Zurück zum Zitat Mokbel MF, Chow C-Y, Aref WG (2006) The new casper: query processing for location services without compromising privacy. In: Proceedings of the 32nd international conference on very large data bases. Korea, pp 763–774 Mokbel MF, Chow C-Y, Aref WG (2006) The new casper: query processing for location services without compromising privacy. In: Proceedings of the 32nd international conference on very large data bases. Korea, pp 763–774
23.
Zurück zum Zitat Moon B, Jagadish HV, Faloutsos C, Saltz JH (2001) Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans Knowl Data Eng 13(1):124–141CrossRef Moon B, Jagadish HV, Faloutsos C, Saltz JH (2001) Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans Knowl Data Eng 13(1):124–141CrossRef
24.
Zurück zum Zitat Preneel B (2003) Analysis and design of cryptographic hash functions. PhD thesis Preneel B (2003) Analysis and design of cryptographic hash functions. PhD thesis
25.
Zurück zum Zitat Sagan H (1994) Space-filling curves. Springer Sagan H (1994) Space-filling curves. Springer
26.
Zurück zum Zitat Samarati P, Sweeney L (1998) Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical Report SRI-CSL-98-04, SRI Computer Science Laboratory Samarati P, Sweeney L (1998) Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical Report SRI-CSL-98-04, SRI Computer Science Laboratory
27.
Zurück zum Zitat Tsai Y-H, Chung K-L, Chen W-Y (2004) A strip-splitting-based optimal algorithm for decomposing a query window into maximal quadtree blocks. IEEE Trans Knowl Data Eng 16(4):519–523CrossRef Tsai Y-H, Chung K-L, Chen W-Y (2004) A strip-splitting-based optimal algorithm for decomposing a query window into maximal quadtree blocks. IEEE Trans Knowl Data Eng 16(4):519–523CrossRef
Metadaten
Titel
Blind evaluation of location based queries using space transformation to preserve location privacy
verfasst von
Ali Khoshgozaran
Houtan Shirani-Mehr
Cyrus Shahabi
Publikationsdatum
01.10.2013
Verlag
Springer US
Erschienen in
GeoInformatica / Ausgabe 4/2013
Print ISSN: 1384-6175
Elektronische ISSN: 1573-7624
DOI
https://doi.org/10.1007/s10707-012-0172-9

Weitere Artikel der Ausgabe 4/2013

GeoInformatica 4/2013 Zur Ausgabe