Privacy-preserving location-dependent query processing

A mobile portable device will often make queries, to a remote database, that depend on its location: It may ask for the nearest coffee shop, restaurant, pharmacy, etc. For privacy reasons, the mobile unit may not wish to disclose its precise location to the remote database - while it is unavoidable that the cell phone company already knows the rough location of the customer ("somewhere in Lafayette "), it is quite another matter if the customer's precise location can be tracked over tune through his pattern of location-dependent queries to the remote database. This work describes an efficient protocol, between the client and database, through which a client can learn the answer to its location-dependent query without revealing to the remote database anything about his location, other than what the database can infer from the answer it gives to the query (which is unavoidable). We also analyze the performance of some other, simpler solutions, that do not require the database to run a protocol with the client, but that can reveal more information about the private location and also introduce inaccuracies in the answer - we quantify how much error these simpler schemes introduce in the answer.

[1]  David G. Kirkpatrick,et al.  Parallel processing for efficient subdivision search , 1987, SCG '87.

[2]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[3]  David G. Kirkpatrick,et al.  Parallel Construction of Subdivision Hierarchies , 1989, J. Comput. Syst. Sci..

[4]  Shan Wang,et al.  Location dependent query in a mobile environment , 2003, Inf. Sci..

[5]  Dik Lun Lee,et al.  Processing location-dependent queries in a multi-cell wireless enviroment , 2001, MobiDe '01.

[6]  Wenliang Du,et al.  Secure Multi-party Computational Geometry , 2001, WADS.

[7]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[8]  Eduardo Mena,et al.  Dealing with continuous location-dependent queries: Just-in-time data refreshment , 2003, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..

[9]  Dimitrios Gunopulos,et al.  Nearest Neighbor Queries in a Mobile Environment , 1999, Spatio-Temporal Database Management.

[10]  Eduardo Mena,et al.  A system based on mobile agents for tracking objects in a location-dependent query processing environment , 2001, 12th International Workshop on Database and Expert Systems Applications.

[11]  Franco P. Preparata,et al.  Sequencing-by-hybridization revisited: the analog-spectrum proposal , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[12]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[13]  Margaret H. Dunham,et al.  Location dependent query processing , 2001, MobiDe '01.

[14]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[15]  Vijay Kumar,et al.  An architecture for location dependent query processing , 2001, 12th International Workshop on Database and Expert Systems Applications.

[16]  Bernard P. Zajac.  Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[17]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[18]  Jeong Hyun Kang,et al.  Combinatorial Geometry , 2006 .