Efficient Attribute-Based Access Control With Authorized Search in Cloud Storage

被引:11
作者
Hao, Jialu [1 ]
Liu, Jian [1 ]
Wang, Huimei [1 ]
Liu, Lingshuang [2 ]
Xian, Ming [1 ]
Shen, Xuemin [3 ]
机构
[1] Natl Univ Def Technol, Coll Elect Sci & Technol, Changsha 410073, Peoples R China
[2] Nucl Power Inst China, Sci & Technol Reactor Syst Design Technol Lab, Chengdu 610213, Peoples R China
[3] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
基金
中国国家自然科学基金;
关键词
Access control; authorized search; cloud storage; data sharing; key-policy attribute-based encryption; PUBLIC-KEY ENCRYPTION; SERVICE; SCHEME;
D O I
10.1109/ACCESS.2019.2906726
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Attribute-based encryption has been widely employed to achieve data confidentiality and fine-grained access control in cloud storage. To enable users to identify accessible data in numerous dataset, clear attributes should be appended to the ciphertext, which results in the exposure of attribute privacy. In this paper, we propose an efficient attribute-based access control with authorized search scheme (EACAS) in cloud storage by extending the anonymous key-policy attribute-based encryption (AKP-ABE) to support fine-grained data retrieval with attribute privacy preservation. Specifically, by integrating the key delegation technique into AKP-ABE, EACAS enables data users to customize search policies based on their access policies, and generate the corresponding trapdoor using the secret key granted by the data owner to retrieve their interesting data. In addition, a virtual attribute with no semantic meaning is utilized in data encryption and trapdoor generation to empower the cloud to perform an attribute-based search on the outsourced ciphertext without knowing the underlying attributes or outsourced data. The data owners can achieve fine-grained access control on their outsourced data, and the data users are flexible to search their interesting data based on protected attributes through customizing the search policies. Finally, we demonstrate that EACAS is more efficient than existing solutions on computation and storage overheads.
引用
收藏
页码:182772 / 182783
页数:12
相关论文
共 37 条
[1]   Charm: a framework for rapidly prototyping cryptosystems [J].
Akinyele, Joseph A. ;
Garman, Christina ;
Miers, Ian ;
Pagano, Matthew W. ;
Rushanan, Michael ;
Green, Matthew ;
Rubin, Aviel D. .
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (02) :111-128
[2]  
[Anonymous], 2012, S PHOT OPT, DOI DOI 10.1109/SOPO.2012.6270923
[3]  
[Anonymous], 2009, PRIVACYAWARE ATTRIBU, DOI DOI 10.1007/978-3-642-04474-8
[4]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[5]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[6]  
Boyen X, 2006, LECT NOTES COMPUT SC, V4117, P290
[7]  
BYUN JW, 2006, PROF WORKSH SEC DAT, V4165, P75
[8]   Generic constructions of integrated PKE and PEKS [J].
Chen, Yu ;
Zhang, Jiang ;
Lin, Dongdai ;
Zhang, Zhenfeng .
DESIGNS CODES AND CRYPTOGRAPHY, 2016, 78 (02) :493-526
[9]  
CUI H, 2017, P C INF SEC PRIV, P10
[10]  
Cui H., 2016, IEEE T DEPEND SECURE, V15, P409