Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4605 LNCS, Issue , 2007, Pages 239-257

  Khoshgozaran, Ali ^a   Shahabi, Cyrus ^a  

^a Information Laboratory ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLIND EQUALIZATION; DYNAMIC PROGRAMMING; NETWORK SECURITY; NEURAL NETWORKS; PUBLIC KEY CRYPTOGRAPHY;

BLIND EVALUATION; LOCATION PRIVACY; LOGARITHMIC COMMUNICATION; NEAREST NEIGHBOR (NN) QUERIES; SPACE TRANSFORMATION;

QUERY PROCESSING;

EID: 37849018331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73540-3_14     Document Type: Conference Paper

References (20)

1. Beresford, A.R., Stajano, F.: Location privacy in pervasive computing. IEEE Pervasive Computing 2(1), 46-55 (2003)
2. Bettini, C., Wang, X.S., Jajodia, S.: Protecting privacy against location-based personal identification. In: Jonker, W., Petković, M. (eds.) SDM 2005. LNCS, vol. 3674, pp. 185-199. Springer, Heidelberg (2005)
3. Faloutsos, C., Roseman, S.: Fractals for secondary key retrieval. In: PODS'89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp. 247-252. ACM Press, New York, NY, USA (1989), doi:10.1145/73721.73746
4. Gedik, B., Liu, L.: A customizable k-anonymity model for protecting location privacy
5. Gruteser, M., Grunwald, D.: Anonymous usage of location-based services through spatial and temporal cloaking. In: MobiSys. USENIX (2003)
6. Gruteser, M., Liu, X.: Protecting privacy in continuous location-tracking applications. IEEE Security & Privacy 2(2), 28-34 (2004)
7. Hilbert, D.: Uber the stetige abbildung einer linie auf ein flachenstuck. Math. Ann. 38, 459-460 (1891)
8. Indyk, P., Woodruff, D.P.: Polylogarithmic private approximations and efficient matching. In: Theory of Cryptography, Third Theory of Cryptography Conference, pp. 245-264. New York, NY, USA (2006)
9. Jagadish, H.V.: Linear clustering of objects with multiple atributes. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 332-342. ACM Press, Atlantic City, NJ (1990)
10. Jagadish, H.V.: Analysis of the hilbert curve for representing two-dimensional space. Inf. Process. Lett. 62(1), 17-22 (1997)
11. Kalnis, P., Ghinita, G., Mouratidis, K., Papadias, D.: Preserving anonymity in location based services. A Technical Report TRB6/06, National University of Singapore (2006)
12. Lawder, J.K., King, P.J.H.: Querying multi-dimensional data indexed using the hilbert space-filling curve. SIGMOD Record 30(1), 19-24 (2001)
13. Mokbel, M.F.: Towards privacy-aware location-based database servers. In: Barga, R.S., Zhou, X. (eds.) ICDE Workshops, p. 93. IEEE Computer Society Press, Los Alamitos (2006)
14. Mokbel, M.F., Chow, C.-Y., Aref, W.G.: The new casper: Query processing for location services without compromising privacy. In: Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, pp. 763-774. ACM Press, New York (2006)
15. Moon, B., Jagadish, H.v., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the hilbert space-filling curve. IEEE Transactions on Knowledge and Data Engineering 13(1), 124-141 (2001), doi:10.1109/69.908985
16. Pinciroli, F., Combi, C., Pozzi, G., Negretto, M., Portoni, L., Invernizzi, G.: A peano hilbert derived algorithm for compression of angiocardiographic images. In: Computers in Cardiology, pp. 81-84. IEEE Computer Society Press, Los Alamitos (1991)
17. Sagan, H.: Space-Filling Curves. Springer, Heidelberg (1994)
18. Samarati, P., Sweeney, L.: Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression
19. Schroeder, M.R.: Number Theory in Science and Communication. Springer, Heidelberg (1984)
20. Stinson, D.R.: Cryptography, Theory and Practice. Chapman & Hall/CRC (2002)