Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017, Article ID 1490283, 14 pages
https://doi.org/10.1155/2017/1490283
Research Article

Efficient Privacy-Preserving Protocol for k-NN Search over Encrypted Data in Location-Based Service

1School of Cyber Security, Shanghai Jiao Tong University, Shanghai 200240, China
2Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China

Correspondence should be addressed to Weidong Qiu; nc.ude.utjs@dwuiq

Received 1 September 2017; Revised 13 November 2017; Accepted 20 November 2017; Published 20 December 2017

Academic Editor: Jia Wu

Copyright © 2017 Huijuan Lian et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Gruteser and D. Grunwald, “Anonymous usage of location-based services through spatial and temporal cloaking,” in Proceedings of the 1st International Conference on Mobile Systems, Applications and Services, pp. 31–42, ACM, San Francisco, Calif, USA, 2003. View at Publisher · View at Google Scholar
  2. M. F. Mokbel, “Towards Privacy-Aware Location-Based database servers,” in Proceedings of the 22nd International Conference on Data Engineering Workshops, ICDEW 2006, USA, April 2006. View at Publisher · View at Google Scholar · View at Scopus
  3. P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias, “Preventing location-based identity inference in anonymous spatial queries,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 12, pp. 1719–1733, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. D. Papadias, D. Zhang, and G. Kollios, Advances in Spatial and Temporal Databases, vol. 4605, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  5. C.-Y. Chow, M. F. Mokbel, and W. G. Aref, “Casper*: query processing for location services without compromising privacy,” ACM Transactions on Database Systems (TODS), vol. 34, no. 4, article 24, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. J.-H. Um, H.-D. Kim, and J.-W. Chang, “An advanced cloaking algorithm using Hilbert curves for anonymous location based service,” in Proceedings of the 2nd International Conference on Social Computing, pp. 1093–1098, Minneapolis, MN, USA, August 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. A.-A. Hossain, A. Hossain, H.-K. Yoo, and J.-W. Chang, “H-star: Hilbert-order based star network expansion cloaking algorithm in road networks,” in Proceedings of the 14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011, the 11th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous Computing and Communications, IUCC 2011, pp. 81–88, chn, August 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. I.-T. Lien, Y.-H. Lin, J.-R. Shieh, and J.-L. Wu, “A novel privacy preserving location-based service protocol with secret circular shift for k-NN search,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 6, pp. 863–873, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. Y. Utsunomiya, K. Toyoda, and I. Sasase, “LPCQP: Lightweight private circular query protocol with divided POI-table and somewhat homomorphic encryption for privacy-preserving k-NN search,” Journal of Information Processing, vol. 24, no. 1, pp. 109–122, 2016. View at Publisher · View at Google Scholar · View at Scopus
  10. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(Leveled) fully homomorphic encryption without bootstrapping,” in Proceedings of the 3rd Conference on Innovations in Theoretical Computer Science, ITCS 2012, pp. 309–325, usa, January 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. H. Sagan, Space-Filling Curves, Springer, New York, NY, USA, 1994. View at Publisher · View at Google Scholar
  12. D. Hilbert, “Ueber die stetige abbildung einer linie auf ein flächenstück,” Mathematische Annalen, vol. 38, no. 3, pp. 459-460, 1891. View at Publisher · View at Google Scholar · View at MathSciNet
  13. B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, “Analysis of the clustering properties of the Hilbert space-filling curve,” IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 1, pp. 124–141, 2001. View at Publisher · View at Google Scholar · View at Scopus
  14. H. V. Jagadish, “Linear clustering of objects with multiple attributes,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 332–342, Atlantic City, NJ, USA, May 1990. View at Scopus
  15. E. H. Moore, “On certain crinkly curves,” Transactions of the American Mathematical Society, vol. 1, no. 1, pp. 72–90, 1900. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” Foundations of Secure Computation, vol. 4, no. 11, pp. 169–180, 1978. View at Google Scholar
  17. C. Gentry, “Fully Homomorphic Encryption Using Ideal Lattices,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC '09, pp. 169–178, usa, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers,” in Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2010), Lecture Notes in Comput. Sci., pp. 24–43, Springer. View at Publisher · View at Google Scholar · View at MathSciNet
  19. N. P. Smart and F. Vercauteren, “Fully homomorphic encryption with relatively small key and ciphertext sizes,” in Proceedings of the International Workshop on Public Key Cryptography, vol. 6056 of Lecture Notes in Comput. Sci., pp. 420–443, Springer. View at Publisher · View at Google Scholar · View at MathSciNet
  20. C. Gentry and S. Halevi, “Implementing Gentry's fully—homomorphic encryption scheme,” in Advances in cryptology—EUROCRYPT 2011, vol. 6632 of Lecture Notes in Computer Science, pp. 129–148, Springer, Heidelberg, Germany, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. C. Gentry and S. Halevi, “Fully homomorphic encryption without squashing using depth-3 arithmetic circuits,” in Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 107–116, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. J.-S. Coron, D. Naccache, and M. Tibouchi, “Public key compression and modulus switching for fully homomorphic encryption over the integers,” in Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2012), vol. 7237 of Lecture Notes in Comput. Sci., pp. 446–464, Springer. View at Publisher · View at Google Scholar · View at MathSciNet
  23. S. Halevi and V. Shoup, “Design and implementation of a homomorphic-encryption libirary,” IBM Research, pp. 12–15, 2013. View at Google Scholar
  24. N. P. Smart and F. Vercauteren, “Fully homomorphic SIMD operations,” Designs, Codes and Cryptography, vol. 71, no. 1, pp. 57–81, 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. C. Gentry, S. Halevi, and N. P. Smart, “Homomorphic evaluation of the AES circuit,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 7417, pp. 850–867, 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. J. Wu, S. Pan, X. Zhu, and Z. Cai, “Boosting for multi-graph classification,” IEEE Transactions on Cybernetics, vol. 45, no. 3, pp. 430–443, 2015. View at Publisher · View at Google Scholar · View at Scopus
  27. J. Wu, X. Zhu, C. Zhang, and P. S. Yu, “Bag Constrained Structure Pattern Mining for Multi-Graph Classification,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 10, pp. 2382–2396, 2014. View at Publisher · View at Google Scholar · View at Scopus
  28. J. Wu, S. Pan, X. Zhu, C. Zhang, and X. Wu, “Positive and Unlabeled Multi-Graph Learning,” IEEE Transactions on Cybernetics, vol. 47, no. 4, pp. 818–829, 2016. View at Publisher · View at Google Scholar · View at Scopus
  29. J. Wu, S. Pan, X. Zhu, C. Zhang, and X. Wu, “Multi-instance learning with discriminative bag mapping,” IEEE Transactions on Knowledge and Data Engineering, no. 99, p. 16, 2018. View at Google Scholar
  30. J. Wu, S. Pan, X. Zhu, C. Zhang, and P. S. Yu, “Multiple Structure-View Learning for Graph Classification,” IEEE Transactions on Neural Networks and Learning Systems, no. 99, pp. 1–16, 2017. View at Publisher · View at Google Scholar
  31. C. Bettini, S. Mascetti, X. S. Wang, D. Freni, and S. Jajodia, “Anonymity and historical-anonymity in location-based services,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 5599, pp. 1–30, 2009. View at Publisher · View at Google Scholar · View at Scopus
  32. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, “-diversity: Privacy beyond k-anonymity,” ACM Transactions on Knowledge Discovery from Data (TKDD), vol. 1, no. 1, Article ID 1217302, 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. M. F. Mokbel, C. Y. Chow, and W. G. Aref, “The new Casper: query processing for location services without compromising privacy,” in Procceedings of the 32nd International Conference on Very Large Data Bases, pp. 763–774, 2006.
  34. R. Dewri, I. Ray, I. Ray, and D. Whitley, “On the formation of historically k-anonymous anonymity sets in a continuous LBS,” Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, vol. 50, pp. 71–88, 2010. View at Publisher · View at Google Scholar · View at Scopus
  35. A. Hossain, A.-A. Hossain, S.-J. Jang, Y.-S. Shin, and J.-W. Chang, “K-anonymous cloaking algorithm based on weighted adjacency graph for preserving location privacy,” in Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012, pp. 358–365, UK, June 2012. View at Publisher · View at Google Scholar · View at Scopus
  36. P. Shankar, Y.-W. Huang, P. Castro, B. Nath, and L. Iftode, “Crowds replace experts: Building better location-based services using mobile social network interactions,” in Proceedings of the 10th IEEE International Conference on Pervasive Computing and Communications, PerCom 2012, pp. 20–29, Switzerland, March 2012. View at Publisher · View at Google Scholar · View at Scopus
  37. Y. Wang, J. Peng, L.-P. He, T.-T. Zhang, and H.-Z. Li, “LBSs privacy preserving for continuous query based on semi-honest third parties,” in Proceedings of the IEEE 31st International Performance Computing and Communications Conference (IPCCC '12), pp. 384–391, IEEE, December 2012. View at Publisher · View at Google Scholar · View at Scopus
  38. Y. Wang, H. Zhou, Y. Wu, and L. Sun, “Preserving location privacy for location-based services with continuous queries on road network,” in Proceedings of the 2012 7th International Conference on Computer Science and Education, ICCSE 2012, pp. 822–827, Australia, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  39. H. Hu, J. Xu, Q. Chen, and Z. Yang, “Authenticating location-based services without compromising location privacy,” in Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD '12, pp. 301–312, May 2012. View at Publisher · View at Google Scholar · View at Scopus
  40. L. Sweeney, “k-anonymity: A model for protecting privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557–570, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  41. 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,” in Proceedings of the IEEE 24th International Conference on Data Engineering (ICDE '08), pp. 366–375, IEEE Press, Cancun, Mexico, April 2008. View at Publisher · View at Google Scholar · View at Scopus
  42. G. Ghinita, P. Kalnis, M. Kantarcioglu, and E. Bertino, “Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection,” GeoInformatica, vol. 15, no. 4, pp. 699–726, 2011. View at Publisher · View at Google Scholar · View at Scopus
  43. W. Ni, J. Zheng, and Z. Chong, “HilAnchor: location privacy protection in the presence of users' preferences,” Journal of Computer Science and Technology, vol. 27, no. 2, pp. 413–427, 2012. View at Publisher · View at Google Scholar · View at Scopus
  44. R. Shokri, P. Papadimitratos, G. Theodorakopoulos, and J.-P. Hubaux, “Collaborative location privacy,” in Proceedings of the 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011, pp. 500–509, Spain, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  45. A. Pingley, N. Zhang, and X. Fu, “Protection of query privacy for continuous location based services,” in Proceedings of the INFOCOM, pp. 1710–1718, IEEE, 2011. View at Publisher · View at Google Scholar
  46. X. Chen and J. Pang, “Exploring dependency for query privacy protection in location-based services,” in Proceedings of the 3rd ACM Conference on Data and Application Security and Privacy, CODASPY 2013, pp. 37–47, USA, February 2013. View at Publisher · View at Google Scholar · View at Scopus
  47. X. Chen and J. Pang, “Measuring query privacy in location-based services,” in Proceedings of 2nd ACM International Conference on Data and Application Security and Privacy, pp. 49–60, San Antonio, Tex, USA, Feburary 2012. View at Publisher · View at Google Scholar