Revocable attribute-based encryption with decryption key exposure resistance and ciphertext delegation

被引:65
作者
Xu, Shengmin [1 ]
Yang, Guomin [1 ]
Mu, Yi [2 ]
机构
[1] Univ Wollongong, Inst Cybersecur & Cryptol, Sch Comp & Informat Technol, Wollongong, NSW, Australia
[2] Fujian Normal Univ, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
Access control; Attribute-based encryption; Revocable storage; Ecryption key exposure; REVOCATION;
D O I
10.1016/j.ins.2018.11.031
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Attribute-based encryption (ABE) enables fine-grained access control over encrypted data. A practical and popular approach for handing revocation in ABE is to use the indirect revocation mechanism, in which a key generation centre (KGC) periodically broadcasts key update information for all data users over a public channel. Unfortunately, existing RABE schemes are vulnerable to decryption key exposure attack which has been well studied in the identity-based setting. In this paper, we introduce a new notion for RABE called re-randomizable piecewise key generation by allowing a data user to re-randmomize the combined secret key and the key update to obtain the decryption key, and the secret key is unrecoverable even both the decryption key and the key update are known by the attacker. We then propose a new primitive called re-randomizable attribute-based encryption (RRABE) that can achieve both re-randomizable piecewise key generation and cipher text delegation. We also refine the existing security model for RABE to capture decryption key exposure resistance and present a generic construction of RABE from RRABE. Finally, by applying our generic transformation, we give a concrete RABE scheme achieving decryption key exposure resistance and ciphertext delegation simultaneously. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:116 / 134
页数:19
相关论文
共 37 条
[1]  
Aiello W, 1998, LECT NOTES COMPUT SC, V1462, P137, DOI 10.1007/BFb0055725
[2]   Attribute-based encryption schemes with constant-size ciphertexts [J].
Attrapadung, Nuttapong ;
Herranz, Javier ;
Laguillaumie, Fabien ;
Libert, Benoit ;
de Panafieu, Elie ;
Rafols, Carla .
THEORETICAL COMPUTER SCIENCE, 2012, 422 :15-38
[3]  
Attrapadung N, 2009, LECT NOTES COMPUT SC, V5921, P278, DOI 10.1007/978-3-642-10868-6_17
[4]   An expressive and provably secure Ciphertext-Policy Attribute-Based Encryption [J].
Balu, A. ;
Kuppusamy, K. .
INFORMATION SCIENCES, 2014, 276 :354-362
[5]   Ciphertext-policy attribute-based encryption [J].
Bethencourt, John ;
Sahai, Amit ;
Waters, Brent .
2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, :321-+
[6]  
Boldyreva A, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P417
[7]  
Boneh D., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P213
[8]  
Boneh D., 2001, METHOD FAST REVOCATI
[9]   Server-Aided Revocable Attribute-Based Encryption [J].
Cui, Hui ;
Deng, Robert H. ;
Li, Yingjiu ;
Qin, Baodong .
COMPUTER SECURITY - ESORICS 2016, PT II, 2016, 9879 :570-587
[10]   Escrow free attribute-based signature with self-revealability [J].
Cui, Hui ;
Wang, Guilin ;
Deng, Robert H. ;
Qin, Baodong .
INFORMATION SCIENCES, 2016, 367 :660-672