|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Kyriakos Mouratidis, Man Lung Yiu, "Anonymous Query Processing in Road Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 1, pp. 2-15, January, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/TKDE.2009.48, author = {Kyriakos Mouratidis and Man Lung Yiu}, title = {Anonymous Query Processing in Road Networks}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {22}, number = {1}, issn = {1041-4347}, year = {2010}, pages = {2-15}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.48}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - Anonymous Query Processing in Road Networks IS - 1 SN - 1041-4347 SP2 EP15 EPD - 2-15 A1 - Kyriakos Mouratidis, A1 - Man Lung Yiu, PY - 2010 KW - Spatial databases KW - road networks KW - location privacy KW - spatial anonymity KW - query processing KW - location-based services. VL - 22 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
[1] http:/www.anonymizer.com/, 2009.
[2] http:/www.mailshell.com, 2009.
[3] http:/www.spamgourmet.com/, 2009.
[4] G. Aggarwal, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi, N. Mishra, R. Motwani, U. Srivastava, D. Thomas, J. Widom, and Y. Xu, “Vision Paper: Enabling Privacy for the Paranoids,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[5] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Hippocratic Databases,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2002.
[6] A.R. Beresford, “Location Privacy in Ubiquitous Computing,” PhD thesis, Computer Laboratory, Univ. of Cambridge, 2005.
[7] T. Brinkhoff, “A Framework for Generating Network-Based Moving Objects,” GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
[8] A.R. Butz, “Alternative Algorithm for Hilbert's Space-Filling Curve,” IEEE Trans. Computers, vol. 20, no. 4, pp. 424-426, Apr. 1971.
[9] C.-Y. Chow and M.F. Mokbel, “Enabling Private Continuous Queries for Revealed User Locations,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2007.
[10] C.-Y. Chow, M.F. Mokbel, and X. Liu, “A Peer-to-Peer Spatial Cloaking Algorithm for Anonymous Location-Based Service,” Proc. Ann. ACM Int'l Symp. Advances in Geographic Information Systems (GIS), 2006.
[11] E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerische Math., vol. 1, pp. 269-271, 1959.
[12] M. Duckham and L. Kulik, “A Formal Model of Obfuscation and Negotiation for Location Privacy,” Proc. Int'l Conf. Pervasive Computing (PERVASIVE), 2005.
[13] J. Edmonds and E. Johnson, “Matching, Euler Tours and the Chinese Postman,” Math. Programming, vol. 5, pp. 88-124, 1973.
[14] B. Gedik and L. Liu, “Location Privacy in Mobile Systems: A Personalized Anonymization Model,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[15] G. Ghinita, P. Kalnis, A. Khoshgozaran, C. Shahabi, and K.-L. Tan, “Private Queries in Location Based Services: Anonymizers Are Not Necessary,” Proc. ACM SIGMOD, 2008.
[16] G. Ghinita, P. Kalnis, and S. Skiadopoulos, “PRIVE: Anonymous Location-Based Queries in Distributed Mobile Systems,” Proc. Int'l World Wide Web Conf. (WWW), 2007.
[17] M. Gruteser and D. Grunwald, “Anonymous Usage of Location-Based Services through Spatial and Temporal Cloaking,” Proc. MobiSys, 2003.
[18] E.G. Hoel and H. Samet, “Efficient Processing of Spatial Queries in Line Segment Databases,” Proc. Int'l Symp. Advances in Spatial Databases (SSD), 1991.
[19] X. Huang, C.S. Jensen, and S. Saltenis, “The Islands Approach to Nearest Neighbor Querying in Spatial Networks,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2005.
[20] P. Indyk and D. Woodruff, “Polylogarithmic Private Approximations and Efficient Matching,” Proc. Theory of Cryptography Conf., 2006.
[21] N. Jefferies, C.J. Mitchell, and M. Walker, “A Proposed Architecture for Trusted Third Party Services,” Proc. Int'l Conf. Cryptography: Policy and Algorithms (CPA), 1995.
[22] N. Jing, Y.W. Huang, and E.A. Rundensteiner, “Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 3, pp. 409-432, May/June 1998.
[23] P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias, “Preserving Location-Based Identity Inference in Anonymous Spatial Queries,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 12, pp. 1719-1733, Dec. 2007.
[24] A. Khoshgozaran and C. Shahabi, “Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2007.
[25] H. Kido, Y. Yanagisawa, and T. Satoh, “An Anonymous Communication Technique using Dummies for Location-Based Services,” Proc. Int'l Conf. Pervasive Services (ICPS), 2005.
[26] M.R. Kolahdouzan and C. Shahabi, “Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[27] T.J. Lehman and M.J. Carey, “Query Processing in Main Memory Database Management Systems,” Proc. ACM SIGMOD, 1986.
[28] M.F. Mokbel, C.-Y. Chow, and W.G. Aref, “The New Casper: Query Processing for Location Services without Compromising Privacy,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2006.
[29] D. Papadias, P. Kalnis, J. Zhang, and Y. Tao, “Efficient OLAP Operations in Spatial Data Warehouses,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2001.
[30] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, “Query Processing in Spatial Network Databases,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[31] S. Shekhar and D. Liu, “CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 1, pp. 102-119, Jan./Feb. 1997.
[32] S. Skiena, “Eulerian Cycles,” Implementing Discrete Math.: Combinatorics and Graph Theory with Mathematica, pp. 192-196, Addison-Wesley, 1990.
[33] L. Sweeney, “$k$ -Anonymity: A Model for Protecting Privacy,” Int'l J. Uncertainty, Fuzziness, and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.
[34] R.J. Wilson, “An Eulerian Trail through Konigsberg,” J. Graph Theory, vol. 10, pp. 265-275, 1986.
[35] M.L. Yiu, C.S. Jensen, X. Huang, and H. Lu, “SpaceTwist: Managing the Trade Offs among Location Privacy, Query Performance, and Query Accuracy in Mobile Services,” Proc. Int'l Conf. Data Eng. (ICDE), 2008.
[36] M.L. Yiu and N. Mamoulis, “Clustering Objects on a Spatial Network,” Proc. ACM SIGMOD, 2004.

