Attribute-Based Expressive and Ranked Keyword Search Over Encrypted Documents in Cloud Computing
- 9 February 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (2) , 957-968
Abstract
Attribute-based keyword search (ABKS) has been proposed to realize fine-grained access control and provide search service in cloud computing. However, most ABKS schemes focus on single or conjunctive keyword search, while the recent Boolean keyword search schemes only support monotonic query formula mainly involving AND, OR and threshold operators. How to support more expressive Boolean query formulas and return the corresponding accurate search results to users have become challenges for practical ABKS over ciphertexts. In this paper, we introduce an attribute-based expressive and ranked keyword search scheme over encrypted documents named ABERKS, which allows authorized users to submit expressive Boolean query formulas involving AND, OR, NOT and threshold operators. ABERKS utilizes a non-monotonic access tree structure to construct the query formula, and further leverages extended Boolean model to rank the search results. Specifically, the users are able to define the weights in the query formula, and get the relevance score of each matched ciphertext if the attributes and keywords are both satisfied. We prove the security of ABERKS against chosen keyword attack under selective ciphertext policy model and against keyword guessing attack, and also conduct extensive experiments to show the efficiency and practicality of ABERKS.Keywords
Funding Information
- National Natural Science Foundation of China (61572080, U1736212)
This publication has 33 references indexed in Scilit:
- Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind StorageIEEE Transactions on Emerging Topics in Computing, 2014
- Protecting Your Right: Verifiable Attribute-Based Keyword Search with Fine-Grained Owner-Enforced Search Authorization in the CloudIEEE Transactions on Parallel and Distributed Systems, 2014
- Expressive and Secure Searchable Encryption in the Public Key Setting2014
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries2013
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization2011
- Public Key Encryption with Keyword Search Revisited2008
- Public Key Encryption with Keyword Search2004
- The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES2001
- One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval2000
- Extended Boolean information retrievalCommunications of the ACM, 1983