Efficient and Expressive Keyword Search Over Encrypted Data in the Cloud

Cui, H, Wan, Z, Deng, R, Wang, G and Li, Y 2018, 'Efficient and Expressive Keyword Search Over Encrypted Data in the Cloud', IEEE Transactions on Dependable and Secure Computing, vol. 15, no. 3, pp. 409-422.

Document type: Journal Article
Collection: Journal Articles

Title Efficient and Expressive Keyword Search Over Encrypted Data in the Cloud
Author(s) Cui, H
Wan, Z
Deng, R
Wang, G
Li, Y
Year 2018
Journal name IEEE Transactions on Dependable and Secure Computing
Volume number 15
Issue number 3
Start page 409
End page 422
Total pages 14
Publisher IEEE
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.
Subject Data Encryption
Keyword(s) Searchable encryption
cloud computing
attribute-based encryption
DOI - identifier 10.1109/TDSC.2016.2599883
Copyright notice © 2016 IEEE
ISSN 1545-5971
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 17 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Altmetric details:
Access Statistics: 34 Abstract Views  -  Detailed Statistics
Created: Thu, 31 Jan 2019, 11:26:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us