作者: Jin Li , Qian Wang , Cong Wang , Kui Ren
DOI: 10.1007/S11036-010-0233-Y
关键词:
摘要: Attribute-based encryption (ABE) has been envisioned as a promising cryptographic primitive for realizing secure and flexible access control. However, ABE is being criticized its high scheme overhead extensive pairing operations are usually required. In this paper, we focus on improving the efficiency of by leveraging previously overlooked fact, i.e., often-found hierarchical relationships among attributes that inherent to many control scenarios. As first research effort along direction, coin notion (HABE), which can be viewed generalization traditional in sense both definitions equal when all independent. We further give concrete HABE construction considering tree hierarchy attributes, provably secure. More importantly, our exhibits significant improvements over attribute hierarchies exist.