Abstract

Attribute based encryption is a promising technique that achieves flexible and fine-grained data access control over encrypted data, which is very suitable for a secure data sharing environment such as the currently popular cloud computing. However, traditional attribute based encryption fails to provide an efficient keyword based search on encrypted data, which somewhat weakens the power of this encryption technique, as search is usually the most important approach to quickly obtain data of interest from large-scale dataset. To address this problem, attribute based encryption with keyword search (ABKS) is designed to achieve fine-grained data access control and keyword based search, simultaneously, by an ingenious combination of attribute based encryption and searchable encryption. Recently, several ABKS schemes have been constructed in secure cloud storage system for data access control and keyword search. Nonetheless, each of these schemes has some defects such as impractical computation overhead and insufficient access policy expression. To overcome these limitations, in this paper, we design a Key-Policy Searchable Attribute-based Encryption Scheme (KPSABES) based on the full-blown key-policy attribute-based encryption proposed by Vipul Goyal et al. By novel design, our scheme not only inherits all advantages of that scheme but also achieves efficient and secure keyword search over encrypted data. We provide the detailed performance analyses and security proofs for our scheme. Extensive experiments demonstrated that our proposed scheme is superior in many aspects to the similar work.

Highlights

  • In Key-Policy Searchable Attribute-based Encryption Scheme (KPSABES) and KP-attribute based encryption with keyword search (ABKS), the time spent on the search keyword encryption was closely related to the number of leaf nodes in the access tree embedded in the data user’s private key

  • When the number of leaf nodes in the access tree was more than 3, our scheme needed more time to generate a search token. This was because key-policy attribute-based keyword search scheme (KP-ABKS) and KPSABES needed 2l + 3 and 3l exponentiation operations to encrypt a search keyword, respectively, where l denotes the number of leaf nodes in the access tree

  • KPSABES is very suitable for the cryptography based data sharing storage system that needs the data access control and keyword based data searching

Read more

Summary

A Key-Policy Searchable Attribute-Based Encryption

Hui Yin 1 , Yinqiao Xiong 1,2, * , Jixin Zhang 3, *, Lu Ou 3 , Shaolin Liao 4,5 and Zheng Qin 3. College of Computer, National University of Defense Technology, Changsha 410073, China. Received: 31 January 2019; Accepted: 25 February 2019; Published: 28 February 2019

Motivation
Searchable Encryption
Attribute Based Encryption
Searchable Attribute-Based Encryption
Contributions
Bilinear Map
Access Tree
Complexity Assumption
System Model
Search Results
Security Model
Definition
Construction
Keygen
Performance Analysis
Security Proof
Experimental Evaluation
Evaluation of Setup Algorithm
Evaluation of Keygen Algorithm
Evaluation of Enc Algorithm
Evaluation of Searchtoken Algorithm
Evaluation of Search Algorithm
Conclusions
Full Text
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