Searchable encryption allows a cloud server to conduct keyword search over encrypted data on behalf of the data users without learning the underlying plaintexts. However, most existing searchable encryption schemes only support single or conjunctive keyword search, while a few other schemes that are able to perform expressive keyword search are computationally inefficient since they are built from bilinear pairings over the composite-order groups. In this paper, we propose an expressive public-key searchable encryption scheme in the prime-order groups, which allows keyword search policies (i.e., predicates, access structures) to be expressed in conjunctive, disjunctive or any monotonic Boolean formulas and achieves significant performance improvement over existing schemes. We formally define its security, and prove that it is selectively secure in the standard model. Also, we implement the proposed scheme using a rapid prototyping tool called Charm , and conduct several experiments to evaluate it performance. The results demonstrate that our scheme is much more efficient than the ones built over the composite-order groups.
attribute-based encryption, Searchable encryption, cloud computing, expressiveness
Information Security | Theory and Algorithms
IEEE Transactions on Dependable and Secure Computing
Institute of Electrical and Electronics Engineers (IEEE)
CUI, Hui; WAN, Zhiguo; DENG, Robert H.; WANG, Guilin; and Yingjiu LI.
Efficient and Expressive Keyword Search Over Encrypted Data in the Cloud. (2016). IEEE Transactions on Dependable and Secure Computing. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3380
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.