Efficient secure similarity computation on encrypted trajectory data

Proceedings - International Conference on Data Engineering

Volumn 2015-May, Issue , 2015, Pages 66-77

  Liu, An ^a,b   Zhengy, Kai ^a,c   Liz, Lu ^d   Liu, Guanfeng ^a,b   Zhao, Lei ^a,b   Zhou, Xiaofang ^a,c  

^a SOOCHOW UNIVERSITY   (China)

^b Collaborative Innovation Center of Novel Software Technology and Industrialization ^*  (China)

^c UNIVERSITY OF QUEENSLAND   (Australia)

^d UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; CRYPTOGRAPHY; DATA HANDLING; DIGITAL STORAGE; OUTSOURCING; POLYNOMIAL APPROXIMATION; QUERY PROCESSING; TRAJECTORIES;

HEALTH CONDITION; SECURE EVALUATIONS; SEMI-HONEST ADVERSARIES; SENSITIVE INFORMATIONS; SIMILARITY COMPUTATION; SPATIO-TEMPORAL RELATIONSHIPS; SPECIAL TREATMENTS; TRAJECTORY SIMILARITIES;

INFORMATION MANAGEMENT;

EID: 84940824696     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2015.7113273     Document Type: Conference Paper

References (33)

1. D. Pfoser, C. S. Jensen, and Y. Theodoridis, "Novel approaches in query processing for moving object trajectories," in VLDB, 2000, pp. 395-406.
2. P. Cudré-Mauroux, E. Wu, and S. Madden, "Trajstore: An adaptive storage system for very large trajectory data sets," in ICDE, 2010, pp. 109-120.
3. H. Su, K. Zheng, H. Wang, J. Huang, and X. Zhou, "Calibrating trajectory data for similarity-based analysis," in SIGMOD, 2013, pp. 833-844.
4. C.-Y. Chow and M. Mokbel, "Privacy of spatial trajectories," in Computing with Spatial Trajectories, Y. Zheng and X. Zhou, Eds. Springer New York, 2011, pp. 109-141.
5. H. Hacigümüs, B. R. Iyer, C. Li, and S. Mehrotra, "Executing sql over encrypted data in the database-service-provider model," in SIGMOD, 2002, pp. 216-227.
6. W. K. Wong, B. Kao, D. W.-L. Cheung, R. Li, and S.-M. Yiu, "Secure query processing with data interoperability in a cloud database environment," in SIGMOD, 2014, pp. 1395-1406.
7. H. Hacigümüs, B. R. Iyer, and S. Mehrotra, "Efficient execution of aggregation queries over encrypted relational databases," in DASFAA, 2004, pp. 125-136.
8. B. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu, "Secure multidimensional range queries over outsourced data," VLDB J., vol. 21, no. 3, pp. 333-358, 2012.
9. P. Wang and C. V. Ravishankar, "Secure and efficient range queries on outsourced databases using rp-trees," in ICDE, 2013, pp. 314-325.
10. W. K. Wong, D. W.-L. Cheung, B. Kao, and N. Mamoulis, "Secure knn computation on encrypted databases," in SIGMOD, 2009, pp. 139-152.
11. H. Hu, J. Xu, C. Ren, and B. Choi, "Processing private queries over untrusted data cloud through privacy homomorphism," in ICDE, 2011, pp. 601-612.
12. B. Yao, F. Li, and X. Xiao, "Secure nearest neighbor revisited," in ICDE, 2013, pp. 733-744.
13. Y. Elmehdwi, B. K. Samanthula, and W. Jiang, "Secure k-nearest neighbor query over encrypted data in outsourced environment," in ICDE, 2014, pp. 664-675.
14. K. Deng, K. Xie, K. Zheng, and X. Zhou, "Trajectory indexing and retrieval," in Computing with Spatial Trajectories, Y. Zheng and X. Zhou, Eds. Springer New York, 2011, pp. 35-60.
15. E. J. Keogh, "Exact indexing of dynamic time warping," in VLDB, 2002, pp. 406-417.
16. M. Vlachos, D. Gunopulos, and G. Kollios, "Discovering similar multidimensional trajectories," in ICDE, 2002, pp. 673-684.
17. L. Chen, M. T. Ö zsu, and V. Oria, "Robust and fast similarity search for moving object trajectories," in SIGMOD, 2005, pp. 491-502.
18. H. Zhu, X. Meng, and G. Kollios, "Privacy preserving similarity evaluation of time series data," in EDBT, 2014, pp. 499-510.
19. A. C.-C. Yao, "How to generate and exchange secrets," in FOCS, 1986, pp. 162-167.
20. C. Hazay and Y. Lindell, Efficient Secure Two-Party Protocols-Techniques and Constructions, ser. Information Security and Cryptography. Springer, 2010.
21. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in EUROCRYPT, 1999, pp. 223-238.
22. Y. Lindell and B. Pinkas, "A proof of security of yao's protocol for twoparty computation," J. Cryptology, vol. 22, no. 2, pp. 161-188, 2009.
23. S. Bugiel, S. Nürnberger, A.-R. Sadeghi, and T. Schneider, "Twin clouds: Secure cloud computing with low latency," in CMS, 2011, pp. 32-44.
24. H. Hu, J. Xu, X. Xu, K. Pei, B. Choi, and S. Zhou, "Private search on key-value stores with hierarchical indexes," in ICDE, 2014, pp. 628-639.
25. V. Kolesnikov and T. Schneider, "Improved garbled circuit: Free xor gates and applications," in ICALP, 2008, pp. 486-498.
26. O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications. Cambridge university press, 2009, vol. 2.
27. Y. Huang, D. Evans, J. Katz, and L. Malka, "Faster secure two-party computation using garbled circuits," in USENIX Security Symposium, 2011.
28. J. Domingo-Ferrer, "A provably secure additive and multiplicative privacy homomorphism," in ISC, 2002, pp. 471-483.
29. C. Gentry, "Fully homomorphic encryption using ideal lattices," in STOC, 2009, pp. 169-178.
30. O. Abul, F. Bonchi, and M. Nanni, "Never walk alone: Uncertainty for anonymity in moving objects databases," in ICDE, 2008, pp. 376-385.
31. M. E. Nergiz, M. Atzori, Y. Saygin, and B. Güç, "Towards trajectory anonymization: a generalization-based approach," Transactions on Data Privacy, vol. 2, no. 1, pp. 47-75, 2009.
32. R. Chen, B. C. M. Fung, and B. C. Desai, "Differentially private trajectory data publication," CoRR, vol. Abs/1112. 2020, 2011.
33. D. Shao, K. Jiang, T. Kister, S. Bressan, and K.-L. Tan, "Publishing trajectory with differential privacy: A priori vs. A posteriori sampling mechanisms," in DEXA, 2013, pp. 357-365.