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.

云计算的日益普及提高了努力改善这种范例服务的重要性。除了保护隐私之外，云存储还需要搜索加密数据，以方便，低成本地访问某些外包数据。安全性和功能性以及效率是可搜索加密方案的重要特征，可改进这些方案，从而使该方案更适用于现实世界。通过向随机SSE方案中添加功能，本文提出了对称可搜索加密（SSE）的结构，以提供最佳方案。我们设计了一个rFSMSE方案，该方案允许通过多个关键字进行搜索。该方案是完全安全的，并且其搜索时间复杂度是对数的。然后，我们将该方案升级到称为rFSVMSE的可验证rFSMSE方案，而不会增加搜索时间，存储和通信的复杂性。我们证明了所提出的方案可以升级为动态方案。仿真表明，在rFSMSE和rFSVMSE方案中搜索多关键字所花费的时间少于以前的随机SSE。