New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters

被引:37
作者
Watanabe, Yohei [1 ,2 ]
Emura, Keita [3 ]
Seo, Jae Hong [4 ]
机构
[1] Univ Electrocommun, Tokyo, Japan
[2] Natl Inst Adv Ind Sci & Technol, Tokyo, Japan
[3] Natl Inst Informat & Commun Technol NICT, Tokyo, Japan
[4] Myongji Univ, Yongin, South Korea
来源
TOPICS IN CRYPTOLOGY - CT-RSA 2017 | 2017年 / 10159卷
关键词
Revocable identity-based encryption; Static assumptions; Asymmetric pairings; IDENTITY-BASED ENCRYPTION; DUAL SYSTEM ENCRYPTION; HIBE;
D O I
10.1007/978-3-319-52153-4_25
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Revoking corrupted users is a desirable functionality for cryptosystems. Since Boldyreva, Goyal, and Kumar (ACM CCS 2008) proposed a notable result for scalable revocation method in identity-based encryption (IBE), several works have improved either the security or the efficiency of revocable IBE (RIBE). Currently, all existing scalable RIBE schemes that achieve adaptively security against decryption key exposure resistance (DKER) can be categorized into two groups; either with long public parameters or over composite-order bilinear groups. From both practical and theoretical points of views, it would be interesting to construct adaptively secure RIBE scheme with DKER and short public parameters in prime-order bilinear groups. In this paper, we address this goal by using Seo and Emura's technique (PKC 2013), which transforms the Waters IBE to the corresponding RIBE. First, we identify necessary requirements for the input IBE of their transforming technique. Next, we propose a new IBE scheme having several desirable properties; satisfying all the requirements for the Seo-Emura technique, constant-size public parameters, and using prime-order bilinear groups. Finally, by applying the Seo-Emura technique, we obtain the first adaptively secure RIBE scheme with DKER and constant-size public parameters in prime-order bilinear groups.
引用
收藏
页码:432 / 449
页数:18
相关论文
共 37 条
  • [1] [Anonymous], IACR CRYPTOLOGY EPRI
  • [2] Barreto PSLM, 2006, LECT NOTES COMPUT SC, V3897, P319
  • [3] Boldyreva A, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P417
  • [4] Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223
  • [5] Identity-based encryption from the Weil pairing
    Boneh, D
    Franklin, M
    [J]. SIAM JOURNAL ON COMPUTING, 2003, 32 (03) : 586 - 615
  • [6] Chen J., 2012, ANONYMOUS ADAPTIVELY
  • [7] Shorter identity-based encryption via asymmetric pairings
    Chen, Jie
    Lim, Hoon Wei
    Ling, San
    Wang, Huaxiong
    Wee, Hoeteck
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (03) : 911 - 947
  • [8] Adaptive-ID Secure Revocable Identity-Based Encryption from Lattices via Subset Difference Method
    Cheng, Shantian
    Zhang, Juanyang
    [J]. INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2015, 2015, 9065 : 283 - 297
  • [9] Semi-Generic Transformation of Revocable Hierarchical Identity-Based Encryption and Its DBDH Instantiation
    Emura, Keita
    Seo, Jae Hong
    Youn, Taek-Young
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (01) : 83 - 91
  • [10] Pairings for cryptographers
    Galbraith, Steven D.
    Paterson, Kenneth G.
    Smart, Nigel P.
    [J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (16) : 3113 - 3121