Abstract-Attribute-based encryption (ABE) has been envisioned as a promising cryptographic primitive for realizing secure and flexible access control. However, ABE is being criticized for its high scheme overhead as extensive pairing operations are usually required. In this paper, we focus on improving the efficiency of ABE by leveraging a previously overlooked fact, i.e., the often-found hierarchical relationships among the attributes that are inherent to many access control scenarios. As the first research effort along this direction, we coin the notion of hierarchical ABE (HABE), which can be viewed as the generalization of traditional ABE in the sense that both definitions are equal when all attributes are independent. We further give a concrete HABE construction considering a tree hierarchy among the attributes, which is provably secure. More importantly, our construction exhibits significant improvements over the traditional ABE when attribute hierarchies exist.
REF improved the efficiency of ABE and coined the notion of hierarchical ABE (HABE), which can be viewed as the generalisation of traditional ABE in the sense that both definitions are equal when all attributes are independent.
Enhancing attribute-based encryption with attribute hierarchy
2009 Fourth International Conference on Communications and Networking in China
2009 Fourth International Conference on Communications and Networking in China
Computer Science