Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

GeoInformatica

Volumn 15, Issue 4, 2011, Pages 699-726

  Ghinita, Gabriel ^a   Kalnis, Panos ^b   Kantarcioglu, Murat ^c   Bertino, Elisa ^a  

^a PURDUE UNIVERSITY   (United States)

^b KING ABDULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Saudi Arabia)

^c UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Homomorphic encryption; Location privacy; Private information retrieval

Indexed keywords

COARSE-GRAINED; COMMUNICATION OVERHEADS; COMPUTATIONAL OVERHEADS; CONVEX POLYGON; CRYPTOGRAPHIC PROTOCOLS; DATA SETS; DATABASE PROTECTION; GLOBAL POSITIONING; HOMOMORPHIC-ENCRYPTIONS; HYBRID ALGORITHMS; HYBRID APPROACH; LOCATION BASED; LOCATION DATA; LOCATION PRIVACY; LOCATION-BASED SERVICES; NEAREST-NEIGHBOR QUERY; ON DYNAMICS; ORDERS OF MAGNITUDE; POINTS OF INTEREST; PRIVATE INFORMATION RETRIEVAL; PROTECTION TECHNIQUES; RECTANGULAR REGIONS; TWO-STEP APPROACH; USER LOCATION; USER PRIVACY; WORST CASE;

ALGORITHMS; COMMUNICATION; CRYPTOGRAPHY; INFORMATION RETRIEVAL; MOBILE DEVICES; PIPE;

QUERY LANGUAGES;

ALGORITHM; DATA PROCESSING; DATA SET; DATABASE; GIS;

EID: 80052963407     PISSN: 13846175     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10707-010-0121-4     Document Type: Article

References (28)

1. Gruteser M, Grunwald D (2003) Anonymous usage of location-based services through spatial and temporal cloaking. In: Proc. of USENIX MobiSys.
2. Gedik B, Liu L (2005) Location privacy in mobile systems: a personalized anonymization model. In: Proc. of ICDCS, pp 620-629.
3. Mokbel MF, Chow CY, Aref WG (2006) The new Casper: query processing for location services without compromising privacy. In: Proc. of VLDB, pp 763-774.
4. Kalnis P, Ghinita G, Mouratidis K, Papadias D (2007) Preserving location-based identity inference in anonymous spatial queries. IEEE TKDE 19(12): 1719-1733.
5. Ghinita G, Kalnis P, Khoshgozaran A, Shahabi C, Tan KL (2008) Private queries in location based services: anonymizers are not necessary. In: SIGMOD, pp 121-132.
6. Kido H, Yanagisawa Y, Satoh T (2005) An anonymous communication technique using dummies for location-based services. In: International conference on pervasive services (ICPS), pp 88-97.
7. Yiu ML, Jensen C, Huang X, Lu H (2008) SpaceTwist: managing the trade-offs among location privacy, query performance, and query accuracy in mobile services. In: International conference on data engineering (ICDE), pp 366-375.
8. Cheng R, Zhang Y, Bertino E, Prahbakar S (2006) Preserving user location privacy in mobile data management infrastructures. In: Privacy enhancing technologies (PET), pp 393-412.
9. Chow CY, Mokbel MF (2007) Enabling private continuous queries for revealed user locations. In: SSTD, pp 258-275.
10. Gruteser M, Liu X (2004) Protecting privacy in continuous location-tracking applications. IEEE Secur Priv 2: 28-34.
11. Damiani M, Bertino E, Silvestri C (2008) PROBE: an obfuscation system for the protection of sensitive location information in LBS. Technical report 2001-145, CERIAS.
12. Khoshgozaran A, Shahabi C (2007) Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy. In: SSTD, pp 239-257.
13. Chor B, Goldreich O, Kushilevitz E, Sudan M (1995) Private information retrieval. In: IEEE symposium on foundations of computer science, pp 41-50.
14. Kushilevitz E, Ostrovsky R (1997) Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: FOCS, pp 364-373.
15. Flath DE (1998) Introduction to number theory. Wiley, New York.
16. Atallah MJ, Du W (2001) Secure multi-party computational geometry. In: WADS '01: Proceedings of the 7th international workshop on algorithms and data structures, pp 165-179.
17. Luo Y, Huang L, Zhong H (2007) Secure two-party point-circle inclusion problem. J Comput Sci Technol 22(1): 88-91.
18. Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: Proceedings of ACM symposium on theory of computing (STOC), pp 218-229.
19. Fischlin M (2001) A cost-effective pay-per-multiplication comparison method for millionaires. In: CT-RSA 2001: Proceedings of the 2001 conference on topics in cryptology, pp 457-472.
20. Blake IF, Kolesnikov V (2004) Strong conditional oblivious transfer and computing on intervals. In: Advances in cryptology-ASIACRYPT 2004, pp 515-529.
21. Lin HY, Tzeng WG (2005) An efficient solution to the millionaires' problem based on homomorphic encryption. In: Intl. conference on applied cryptography and network security, pp 456-466.
22. Yao AC (1982) Protocols for secure computations. In: SFCS '82: Proceedings of the 23rd annual symposium on foundations of computer science, pp 160-164.
23. Chow CY, Mokbel MF, Liu X (2006) A peer-to-peer spatial cloaking algorithm for anonymous location-based service. In: GIS, pp 171-178.
24. Ghinita G, Kalnis P, Skiadopoulos S (2007) PRIVE: anonymous location-based queries in distributed mobile systems. In: WWW, pp 371-380.
25. Ghinita G, Kalnis P, Skiadopoulos S (2007) MobiHide: a mobile peer-to-peer system for anonymous location-based queries. In: SSTD, pp 221-238.
26. Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT, pp 223-238.
27. Atallah MJ (1998) Algorithms and theory of computation handbook. CRC Press, Boca Raton.
28. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O (2000) Computational geometry: algorithms and applications, 2nd edn. Springer, Berlin.