Abstract

Searching on encrypted data has become a very important technique in cloud computing. Such searches enable the data owner to search on the encrypted data stored on the cloud without leaking any information. To obtain a better search experience, researchers have proposed many schemes which mainly focus on conjunctive and disjunctive keyword searches. However, conjunction of all the keywords may result in very few results, whereas a disjunction will return too many results. With the current schemes, customizing the relevancy of the keywords to obtain the desired results is difficult. To solve these problems, we propose a novel scheme that supports the search with the user-specified number of keywords contained in the search result. This number $n$ can be used to customize the keyword relevancy. As a result, the data owner could obtain the desired search results containing any $n$ keywords of a keyword set. The proposed scheme also supports the traditional disjunctive and conjunctive keyword searches when $n$ equals 1 or the size of the keyword set, respectively. The keyword could be positive or negative. We first formally define its security and then prove that the proposed scheme is secure against the adaptively chosen keyword attack in the standard model and can defend against the offline keyword guessing attack to some extent. Furthermore, we present a theoretical performance comparison with other schemes as well as the experimental performance evaluations on our implemented scheme.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.