IEEE Access (Jan 2020)

An Efficient Privacy-Preserving Multi-Keyword Query Scheme in Location Based Services

  • Shiwen Zhang,
  • Tingting Yao,
  • Wei Liang,
  • Voundi Koe Arthur Sandor,
  • Kuan-Ching Li

DOI
https://doi.org/10.1109/ACCESS.2020.3018417
Journal volume & issue
Vol. 8
pp. 154036 – 154049

Abstract

Read online

With the proliferation of location-aware mobile devices and the prevalence of wireless communications, location-based services (LBS) have attracted much particular attention in recent years. For flexibility and cost savings, the LBS provider outsources the LBS data to the cloud in order to serve the increasing number of mobile users. To guarantee users' privacy and data confidentiality, some excellent works have been proposed which focus on secure query over the location server. However, these existing works have two limitations. On the one hand, they cannot preserve users' location and query content privacy simultaneously. On the other hand, they fail to support multi-keyword queries. In this article, aiming at a multi-keywords query in LBS, we propose a novel efficient and privacy-preserving multi-keyword query scheme (PPMQ) over the outsourced cloud, which satisfies the requirements of the location and query content privacy protection, query efficiency, the confidentiality of LBS data and scalability regarding the data users. To improve the efficiency of our proposed scheme, we utilize the linear quad-tree technique to build a grid system to represent the location information in the query condition as well as a searchable index. To protect the location privacy, we combine decimal Morton code and public-key cryptography techniques to build a searchable index or to generate a trapdoor. To enable the cloud server to perform a secure multi-keyword query, we systematically construct a privacy-preserving query scheme with bilinear pairing-based cryptography. In particular, our proposed scheme is scalable and very suitable for multi-user environments due to the flexible user registration and revocation mechanisms. Furthermore, a detailed security analysis shows that the proposed scheme can ensure the confidentiality of LBS data, and protect the location and query content privacy. Extensive experiments are conducted on a real LBS dataset, and the simulation results confirm the security and efficiency of our scheme.

Keywords