Abstract
With the rise of cloud computing, data owners outsource their data to public cloud servers while allowing users to search the data, aiming at greater flexibility and economic savings. For privacy considerations, private data must be encrypted before outsourcing, and this makes the method of plaintext keyword search infeasible. However, it is critical to enable encrypted data able to be searched. Considering the requirements of practical application scenarios, the function of efficient multi-keyword ranked search and similarity search based on relevance score is necessary for data users. There proposed a number of multi-keyword searchable encryption schemes to try to meet this demand. However, most existing schemes do not satisfy required dynamic update simultaneously. In this paper, a novel and efficient dynamic multi-keyword ranked search scheme improved from traditional secure kNN computation is proposed. The proposed scheme incorporates the similarity measure “coordinate matching” and “inner product similarity” to improve the relevance of search keywords to the relevant cloud files. A reverse data structure is introduced to allow users to perform dynamic operations on document collection, either inserting or deleting. The sparse matrix is used to replace the dense large-scale matrix in index encryption and query vector encryption to improve efficiency. Experiments show that the proposed scheme indeed reduces the overhead of computation and storage compared to MRSE scheme, concurrently guaranteeing privacy and efficiency.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig4_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig5_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig6_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig7_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig8_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig9_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-017-2684-6/MediaObjects/500_2017_2684_Fig10_HTML.gif)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Cao N, Wang C, Li M, Ren K, Lou W (2014) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222–233
Curtmola R, Garay J, Kamara S, Ostrovsky R (2011) Searchable symmetric encryption: improved definitions and efficient constructions. J Comput Secur 19(5):895–934
Deng Z, Li K, Li K, Zhou J. A multi-user searchable encryption scheme with keyword authorization in a cloud storage. Future Gener Comput Syst. doi:10.1016/j.future.2016.05.017
Gajek S (2016) Dynamic symmetric searchable encryption from constrained functional encryption. In: Proceedings of the cryptographers’ track at the RSA conference, pp 75–89
Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of symposium on the theory of computing (STOC), pp 169–178
Goh E-J (2003) Secure indexes. Cryptology ePrint Archive: Report 2003/216
Goldreich O, Ostrovsky R (1996) Software protection and simulation on oblivious RAMs. J ACM 43(3):431–473
Ishai Y, Kushilevitz E, Ostrovsky R, Sahai A (2006) Cryptography from anonymity. In: Proceedings of the 47th annual IEEE symposium on foundations of computer science, pp 239–248
Kiayias A, Oksuz O, Russell A, Tang Q, Wang B (2016) Efficient encrypted keyword search for multi-user data sharing. In: Proceedings of European symposium on research in computer security (ESORICS), pp 173–195
Mashauri D, Li R, Han H, Gu X , Xu Z, Xu CZ (2015) Adaptive multi-keyword ranked search over encrypted cloud data. In: Proceedings of the international conference on collaborative computing: networking, applications and worksharing, pp 3–13
Poon HT, Miri A (2015) An efficient conjunctive keyword and phase search scheme for encrypted cloud storage systems. In: Proceedings of IEEE 8th international conference on cloud computing, pp 508–515
Rane DD, Ghorpade VR (2015) Multi-user multi-keyword privacy preserving ranked based search over encrypted cloud data. In: Proceedings of the international conference on pervasive computing (ICPC), pp 1–4
Singhal A (2001) Modern information retrieval: a brief overview. IEEE Comput Soc Tech Comm Data Eng Bull 24(4):35–43
Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceedings of IEEE symposium on security and privacy, pp 44–55
Tang Q (2014) Nothing is for free: security in searching shared and encrypted data. IEEE Trans Inf Forensics Secur 9(11):1943–1952
Wang C, Cao N, Li J, Ren K, Lou W (2012) Enabling secure and efficient ranked keyword search over outsourced cloud data. IEEE Trans Parallel Distrib Syst 23(8):1467–1479
Wang B, Yu S, Lou W, Hou YT (2014) Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: Proceedings of IEEE conference on computer communications, pp 2112–2120
Witten IH, Moffat A (1999) Managing gigabytes: compressing and indexing documents and images, second edition. Morgan Kaufmann
Wong WK, Cheung DW, Kao B, Mamoulis N (2009) Secure kNN computation on encrypted databases. In: Proceedings of ACM SIGMOD international conference on management of data, pp 139–152
Xhafa F, Wang J, Chen X, Krause PJ (2014) An efficient PHR service system supporting fuzzy keyword search and fine-grained access control. Soft Comput 18(9):1795–1802
Xia Z, Chen L, Sun X, Liu J (2016) A multi-keyword ranked search over encrypted cloud data supporting semantic extension. Int J Multimed Ubiquitous Eng 11(8):107–120
Xia Z, Wang X, Sun X, Wang Q (2016) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340–352
Yang C, Zhang W, Xu J, Xu J, Yu N (2012) A fast privacy-preserving multi-keyword search scheme on cloud data. In: Proceedings of the international conference on cloud and service computing (CSC), pp 104–110
Ye J, Wang J, Zhao J, Shen J, Li K-C. Fine-grained searchable encryption in multi-user setting. Soft Comput. doi:10.1007/s00500-016-2179-x
Zhang B, Zhang F (2011) An efficient public key encryption with conjunctive-subset keywords search. J Netw Comput Appl 34(1):262–267
Zhangjie F, Sun X, Qi Liu L, Zhou JS (2015) Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun 98(1):190–200
Zhang W, Xiao S, Lin Y, Zhou T, Zhou S (2014) Secure ranked multi-keyword search for multiple data owners in cloud computing. In: Proceedings of the 44th annual IEEE/IFIP international conference on dependable systems and networks, pp 276–286
Zou Q, Wang J, Ye J, Shen J, Chen X (2017) Efficient and secure encrypted image search in mobile cloud computing. Soft Comput. doi:10.1007/s00500-016-2153-7
Acknowledgements
This work was supported by the Natural Science Foundation of China (Nos. 61602118, 61572010 and 61472074), Fujian Normal University Innovative Research Team (No. IRTL1207), Natural Science Foundation of Fujian Province (No. 2015J01240), Science and Technology Projects of Educational Office of Fujian Province (No. JK2014009) and Fuzhou Science and Technology Plan Project (No. 2014-G-80).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
Lanxiang Chen declares that she has no conflict of interest. Linbing Qiu declares that he has no conflict of interest. Kuan-Ching Li declares that he has no conflict of interest. Wenbo Shi declares that he has no conflict of interest. Nan Zhang declares that he has no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Chen, L., Qiu, L., Li, KC. et al. DMRS: an efficient dynamic multi-keyword ranked search over encrypted cloud data. Soft Comput 21, 4829–4841 (2017). https://doi.org/10.1007/s00500-017-2684-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-017-2684-6