Abstract
Searchable encryption allows a remote server to search over encrypted documents without knowing the sensitive data contents. Prior searchable symmetric encryption schemes focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes improve system usability by retrieving the matched documents. In this type of search, the user has to repeatedly perform the search protocol for many times. Most of existent (CKS) schemes use conjunctive keyword searches with fixed position keyword fields, this type of search is not useful for many applications, such as unstructured text. In our paper, we propose a new public key encryption scheme based on bilinear pairings, the scheme supports conjunctive keyword search queries on encrypted data without needing to specify the positions of the keywords where the keywords can be in any arbitrary order. Instead of giving the server one trapdoor for each keyword in the conjunction set, we use a bilinear map per a set of combined keywords to make them regarded as one keyword. In another meaning, the proposed method will retrieve the data in one round of communication between the user and server. Furthermore, the search process could not reveal any information about the number of keywords in the query expression. Through analysis section we determine how such scheme could be used to guarantee fast and secure access to the database.
Highlights
Cloud computing has become the most common phenomenon in the recent years
To securely search through encrypted data, searchable encryption schemes have been introduced in recent years [2,3,4,5,6,7,8], which can be divided into two schemes: symmetric searchable encryption (SSE) and asymmetric searchable encryption (ASE)
To perform a search on a dataset, an user creates an index of keywords listed in the documents and later on executes the search on the index in a way that allows the server to retrieve the documents contain a certain keyword instead of retrieving all the encrypted documents back which is fully impractical solution in cloud computing scenarios
Summary
Cloud computing has become the most common phenomenon in the recent years. More and more cloud services have flourished all around the world such as computing resource, storage space outsourcing and different kinds of software applications. To support multiple Boolean encrypted keywords, such as conjunction operation, we consider a mail server, shown, which retrieves a stream of email encrypted messages, each email will be defined some keyword fields, like ”From”, ”Date” and ”Status”. Existent schemes for conjunctive keywords search ([11] and subsequent works) were supporting keyword fields in the index This setting is not useful and much more difficult to search in most systems, such as the database text and the body of e-mail. Despite the efficiency of Public-key Encryption with Keyword Search scheme PEKS[4], there are some important cases relating the use of PEKS, which were studied in[18] One of these cases is that the scheme did not support the notion of the multiple keywords search. We show that our scheme is secure against adaptive chosen-keyword attacks in the random oracle model ROM under the Bilinear Diffie Hellman assumption
Sign-in/Register to view highlights & summary 
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