期刊
MOBILE NETWORKS & APPLICATIONS
卷 16, 期 5, 页码 553-561出版社
SPRINGER
DOI: 10.1007/s11036-010-0233-y
关键词
attribute-based; hierarchy; encryption; access control; pairing
类别
资金
- US National Science Foundation [CNS-0831963]
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [0831963] Funding Source: National Science Foundation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据