KP-HABE: A Fully Secure Key-Policy Hierarchical Attribute-Based Encryption

Abstract

One drawback of the traditional KP-ABE is the limitation for expressing the hierarchical structure of attributes. In this paper, we firstly propose a fully secure Key-Policy Hierarchical Attribute-based encryption (KP-HABE). In KP-HABE, attribute is expressed by a vector in order to facilitate the indication of the hierarchical structure of attribute. The technique of composite order bilinear pairing and linear secret sharing scheme is used to build the KP-HABE scheme.