Efficient Privacy-Preservation Multi-factor Ranking with Approximate Search over Encrypted Big Cloud Data

  • Jing He
  • Yiming Wu
  • Guangli Xiang
  • Zhendong Wu
  • Shouling JiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10581)


Encrypting data before outsourcing data has become a challenge in using traditional search algorithms. Many techniques have been proposed to cater the needs. However, as cloud service has a pay-as-you-go basis, these techniques are inefficiency. In this paper we attack the challenging problem by proposing an approximate multi keyword search with multi factor ranking over encrypted cloud data. Moreover, we establish strict privacy requirements and prove that the proposed scheme is secure in terms of privacy. To the best of our knowledge, we are the first who propose approximate matching technique on semantic search. Furthermore, to improve search efficiency, we consider multi-factor ranking technique to rank a query for documents. Through comprehensive experimental analysis combined with real world data, our proposed technique shows more efficiency and can retrieve more accurate results and meanwhile improve privacy by introducing randomness in query data.



This work was partly supported by the Kennesaw State University College of Science and Mathematics the interdisciplinary Research Opportunities Program (IDROP), and the Office of the Vice President for Research (OVPR) Pilot/Seed Grant.

This was also partly supported by NSFC under No. 61772466, the Provincial Key Research and Development Program of Zhejiang, China under No. 2017C01055, the Fundamental Research Funds for the Central Universities, the Alibaba-Zhejiang University Joint Research Institute for Frontier Technologies (A.Z.F.T.) under Program No. XT622017000118, the CCF-Tencent Open Research Fund under No. AGR20160109, the National Key Research and Development Program of China (2016YFB0800201), and the Natural Science Fundation of Zhejiang Province (LY16F020016).


  1. 1.
    Chapman, C., Emmerich, W., Clayman, S.: Software architecture definition for on-demand cloud provisioning. Cluster Comput. 15(2), 79–100 (2012)CrossRefGoogle Scholar
  2. 2.
    Li, M., Yu, S., Cao, N., Lou, W.: Authorized private keyword search over encrypted data in cloud computing. In: 2011 31st International Conference on Distributed Computing Systems (ICDCS), pp. 383–392. IEEE (2011)Google Scholar
  3. 3.
    Ji, S., Li, W., He, J., Srivatsa, M., Beyah, R.: Poster: Optimization based data de-anonymization2014. In: Poster Presented at the 35th IEEE Symposium on Security and Privacy, May, vol. 18, p. 21 (2014)Google Scholar
  4. 4.
    Wang, C., Wang, Q., Ren, K., Cao, N., Lou, W.: Toward secure and dependable storage services in cloud computing. IEEE Trans. Serv. Comput. 5(2), 220–232 (2012)CrossRefGoogle Scholar
  5. 5.
    Cao, N., Wang, C., Li, M., Ren, K., Lou, W.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 25(1), 222–233 (2014)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Jing He
    • 1
  • Yiming Wu
    • 2
  • Guangli Xiang
    • 3
  • Zhendong Wu
    • 4
  • Shouling Ji
    • 2
    Email author
  1. 1.Department of Computer ScienceKennesaw State UniversityMariettaGeorgia
  2. 2.School of Computer Science and TechnologyZhejiang UniversityHanzhouChina
  3. 3.School of Computer Science and TechnologyWuhan University of TechnologyWuhanChina
  4. 4.School of CyberspaceHangzhou Dianzi UniversityHanzhouChina

Personalised recommendations