Collaborative Computing: Networking, Applications, and Worksharing. 11th International Conference, CollaborateCom 2015, Wuhan, November 10-11, 2015, China. Proceedings

Research Article

Adaptive Multi-keyword Ranked Search Over Encrypted Cloud Data

Download
686 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-28910-6_1,
        author={Daudi Mashauri and Ruixuan Li and Hongmu Han and Xiwu Gu and Zhiyong Xu and Cheng-zhong Xu},
        title={Adaptive Multi-keyword Ranked Search Over Encrypted Cloud Data},
        proceedings={Collaborative Computing: Networking, Applications, and Worksharing. 11th International Conference, CollaborateCom 2015, Wuhan, November 10-11, 2015, China. Proceedings},
        proceedings_a={COLLABORATECOM},
        year={2016},
        month={2},
        keywords={Cloud computing Searchable encryption Multi-keyword query Ranked search Encrypted data},
        doi={10.1007/978-3-319-28910-6_1}
    }
    
  • Daudi Mashauri
    Ruixuan Li
    Hongmu Han
    Xiwu Gu
    Zhiyong Xu
    Cheng-zhong Xu
    Year: 2016
    Adaptive Multi-keyword Ranked Search Over Encrypted Cloud Data
    COLLABORATECOM
    Springer
    DOI: 10.1007/978-3-319-28910-6_1
Daudi Mashauri1,*, Ruixuan Li1,*, Hongmu Han1,*, Xiwu Gu1,*, Zhiyong Xu2,*, Cheng-zhong Xu,*
  • 1: Huazhong University of Science and Technology
  • 2: Suffolk University
*Contact email: daudimasha@live.com, rxli@hust.edu.cn, hanhongmu@hust.edu.cn, guxiwu@hust.edu.cn, zxu@mcs.suffolk.edu, czxu@wayne.edu

Abstract

To preserve data privacy and integrity, sensitive data has to be encrypted before outsourcing to the cloud server. However, this makes keyword search based on plaintext queries obsolete. Therefore, supporting efficient keyword based ranked searches over encrypted data became an open challenge. In recent years, several multi-keyword ranked search schemes have been proposed in trying to solve the posed challenge. However, most recently proposed schemes don’t address the issues regarding dynamics in the keyword dictionary. In this paper, we propose a novel scheme called A-MRSE that addresses and solves these issues. We introduce new algorithms to be used by data owners each time they make modifications that affects the size of the keyword dictionary. We conduct multiple experiments to demonstrate the effectiveness of our newly proposed scheme, and the results illustrates that the performance of A-MRSE scheme is much better that previously proposed schemes.