Efficient and dynamic verifiable multi-keyword searchable symmetric encryption with full security

Majid Bayat | Aniseh Najafi | Hamid Haj Seyyed Javadi

---

URL :   http://research.shahed.ac.ir/WSR/WebPages/Report/PaperView.aspx?PaperID=158521
Date :  2021/04/27
Publish in :    Multimedia Tools and Applications

Link :  https://link.springer.com/article/10.1007/s11042-021-10844-w
Keywords :Randomized symmetric searchable encryption · Multi-keyword search · Dynamics · Verifiability · Binary search · Plaintext privacy · Predicate privacy · Full security

Abstract :

---

Increasing the popularity of cloud computing raises the importance of efforts to improve the services of this paradigm. Searching over encrypted data is a requirement for cloud storage to provide, in addition to privacy-preserving, convenient and low-cost access to some of the outsourced data. Security and functionality along with efficiency are important characteristics of searchable encryption schemes that improve them make this schemes more applicable to the real world. There are proposed structures for symmetric searchable encryption (SSE) in this paper, by adding functionalities to randomized SSE schemes, to provide a optimal scheme. We design a rFSMSE scheme that allows searching by multiple keywords. This scheme is fully secure and its search time complexity is logarithmic. Then we upgrad this scheme to the verifiable rFSMSE scheme called rFSVMSE, without increasing the complexity of search time, storage, and communication. We demonstrate that the proposed schemes are upgradable to dynamic ones. Simulations show the time taken to search for multi-keywords in the rFSMSE and rFSVMSE schemes is less than that in the previous randomized SSE.