Complete Robustness in Identity-Based Encryption

被引:0
作者
Cui, Hui [1 ]
Mu, Yi [1 ]
Au, Man Ho [1 ]
机构
[1] Univ Wollongong, Sch Comp Sci & Software Engn, Wollongong, NSW 2522, Australia
来源
PROVABLE SECURITY, PROVSEC 2014 | 2014年 / 8782卷
关键词
Identity-based encryption; CROB; RKA security;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Complete robustness (CROB) was proposed to guarantee that for a public key encryption scheme, decryption attempts will fail with high probability if the wrong decryption key is used to decrypt a ciphertext, even if the keys are maliciously generated by the adversary. In this paper, we extend the notion of complete robustness to the identity-based setting. We firstly formalize the CROB for identity-based encryption, and present a generic construction achieving CROB from an arbitrary identity-based encryption scheme. After that, we investigate whether there exist some kind of relations between CROB and related-key attack (RKA) security for the case of identity-based encryption. We conclude that these two notions (CROB and RKA security) are separable for identity-based encryption, but with a slight modification to our generic construction, an identity-based encryption scheme offering complete robustness with security against related-key attacks can be constructed from any identity-based encryption scheme.
引用
收藏
页码:342 / 349
页数:8
相关论文
共 21 条
[1]  
Abdalla M, 2010, LECT NOTES COMPUT SC, V5978, P480, DOI 10.1007/978-3-642-11799-2_28
[2]  
[Anonymous], 1993, LNCS, DOI DOI 10.1007/3-540-57220-162
[3]  
[Anonymous], 1997, EUROCRYPT
[4]  
[Anonymous], 1991, 23 ACM STOC
[5]  
Barth A, 2006, LECT NOTES COMPUT SC, V4107, P52
[6]  
Bellare M, 2003, LECT NOTES COMPUT SC, V2656, P491
[7]  
Bellare M., 2001, P INT C THEOR APPL C, P566
[8]  
Bellare M, 2012, LECT NOTES COMPUT SC, V7658, P331, DOI 10.1007/978-3-642-34961-4_21
[9]  
Bellare M, 2011, LECT NOTES COMPUT SC, V7073, P486, DOI 10.1007/978-3-642-25385-0_26
[10]  
Biham E, 1997, LECT NOTES COMPUT SC, V1294, P513