Blind evaluation of location based queries using space transformation to preserve location privacy
暂无分享,去创建一个
[1] Panos Kalnis,et al. Private queries in location based services: anonymizers are not necessary , 2008, SIGMOD Conference.
[2] D. Hilbert. Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .
[3] Marco Gruteser,et al. USENIX Association , 1992 .
[4] Christos Faloutsos,et al. Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..
[5] Walid G. Aref,et al. Casper*: Query processing for location services without compromising privacy , 2006, TODS.
[6] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[7] Cyrus Shahabi,et al. Location privacy: going beyond K-anonymity, cloaking and anonymizers , 2011, Knowledge and Information Systems.
[8] Pierangela Samarati,et al. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression , 1998 .
[9] Christos Faloutsos,et al. Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperectangles , 1997, IEEE Trans. Knowl. Data Eng..
[10] Dmitri Asonov. Querying Databases Privately: A New Approach to Private Information Retrieval , 2004, Lecture Notes in Computer Science.
[11] Pieter Retief Kasselman,et al. Analysis and design of cryptographic hash functions , 1999 .
[12] X. S. Wang,et al. Preserving Anonymity in Location-based Services When Requests from the Same Issuer May Be Correlated , 2007 .
[13] H. V. Jagadish,et al. Analysis of the Hilbert Curve for Representing Two-Dimensional Space , 1997, Inf. Process. Lett..
[14] H. V. Jagadish,et al. Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.
[15] Panos Kalnis,et al. Providing K-Anonymity in location based services , 2010, SKDD.
[16] David P. Woodruff,et al. Polylogarithmic Private Approximations and Efficient Matching , 2006, TCC.
[17] Ling Liu,et al. A Customizable k-Anonymity Model for Protecting Location Privacy , 2004 .
[18] Cyrus Shahabi,et al. Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy , 2007, SSTD.
[19] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[20] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[21] Hosagrahar V. Jagadish,et al. Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, May 23-25, 1990. , 1990, SIGMOD 1990.
[22] Kuo-Liang Chung,et al. Space-filling approach for fast window query on compressed images , 2000, IEEE Trans. Image Process..
[23] Pierangela Samarati,et al. Location privacy in pervasive computing , 2008 .
[24] Kuo-Liang Chung,et al. A strip-splitting-based optimal algorithm for decomposing a query window into maximal quadtree blocks , 2004, IEEE Transactions on Knowledge and Data Engineering.
[25] Christos Faloutsos,et al. Fractals for secondary key retrieval , 1989, PODS.
[26] D. Hilbert. Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .
[27] Peter J. H. King,et al. Querying multi-dimensional data indexed using the Hilbert space-filling curve , 2001, SGMD.
[28] Luc Bouganim,et al. Chip-Secured Data Access: Confidential Data on Untrusted Servers , 2002, VLDB.
[29] H. Sagan. Space-filling curves , 1994 .
[30] Hung-Yu Chien,et al. An Efficient and Practical Solution to Remote Authentication: Smart Card , 2002, Comput. Secur..