Murdoch University Research Repository

Welcome to the Murdoch University Research Repository

The Murdoch University Research Repository is an open access digital collection of research
created by Murdoch University staff, researchers and postgraduate students.

Learn more

Efficient and expressive keyword search over encrypted data in cloud

Cui, H.ORCID: 0000-0002-5820-2233, Wan, Z., Deng, R.H., Wang, G. and Li, Y. (2018) Efficient and expressive keyword search over encrypted data in cloud. IEEE Transactions on Dependable and Secure Computing, 15 (3). pp. 409-422.

Link to Published Version: https://doi.org/10.1109/TDSC.2016.2599883
*Subscription may be required

Abstract

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 [37], 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.

Item Type: Journal Article
Publisher: IEEE
Copyright: © 2019 IEEE
URI: http://researchrepository.murdoch.edu.au/id/eprint/44029
Item Control Page Item Control Page