Abstract

Cloud computing is often regarded as a great innovation due to the increasing demand for endless storage space and reliable retrieval services. Several works have been developed on ranked multi-keyword search over cloud data with numerous data owners concerned about privacy. However, most of these methods can be broken by a clever attacker using a combination of a keyword guess and an equivalency test. Also, when searching across data from many data owners, they can't reliably return the top k results to the users. The unreliability of search results and the potential for the exposure of critical keyword information are two obvious drawbacks. To address this issue, we first propose a novel efficient ranked multi-keyword retrieval scheme with keyword privacy for multiple data owners, allowing the cloud server to perform multikeyword search over the cloud data and then return the top-k ranked search results to data users without leaking any keyword and trapdoor information. Furthermore, we demonstrate through stringent security analysis that our method is safe from both internal and external threats. Finally, the results of the performance evaluation show that our scheme outperforms other ranked multi-keyword search systems. Keywords: cloud computing, multi-keyword retrieval, multiple data owner model, privacy sensitive, ranked.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call