Abstract
Searchable public key encryption supporting conjunctive keyword search is an important technique in today’s cloud environment. Nowadays, previous schemes usually take advantage of forward index structure, which leads to a linear search complexity. In order to obtain better search efficiency, in this paper, we utilize a tree index structure instead of forward index to realize such schemes. To achieve the goal, we first give a set of keyword conversion methods that can convert the index and query keywords into a group of vectors and then present a novel algorithm for building index tree based on these vectors. Finally, by combining an efficient predicate encryption scheme to encrypt the index tree, a tree-based public key encryption with conjunctive keyword search scheme is proposed. The proposed scheme is proven to be secure against chosen plaintext attacks and achieves a sublinear search complexity. Moreover, both theoretical analysis and experimental result show that the proposed scheme is efficient and feasible for practical applications.
Highlights
With the rapid development of cloud computing, many enterprises and individuals are willing to store their data over the cloud server for the sake of its efficiency and convenience
Considering that the tree structure commonly owns a better search performance than the forward index structure, this paper aims to construct a public key encryptions with conjunctive keyword search (PECK) scheme under a tree index structure to achieve a sublinear search efficiency without sacrificing encryption efficiency
We introduce three methods related to building the index tree. e first method is a keyword conversion method which changes document and query keywords into an attribute vector and a predicate vector, respectively. is conversion method is used to construct leaf nodes. e second method aims to create “0-1” vectors of internal nodes of the index tree. rough randomly partitioning all the keywords in the corpus into a set of clusters, we devise a “converting and merging” algorithm to create “0-1” vectors based on these clusters. e third method is a recursive algorithm, which elaborately combines the first and second methods to create the index tree
Summary
With the rapid development of cloud computing, many enterprises and individuals are willing to store their data over the cloud server for the sake of its efficiency and convenience. If the cloud server is compromised by some malicious intruder, these data can be accessed by them with no obstacles To overcome this problem, a straightforward approach is encrypting data before outsourcing them. A straightforward approach is encrypting data before outsourcing them This trivial approach needs to download all encrypted data to the client and perform a keyword search after decrypting these data. Because this method is inefficient, if the amount of data is relatively large, exploring a new technology which can retrieve encrypted data on the cloud server without decryption is of prime importance in practical application
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: 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.
