TY - GEN
T1 - Unbounded hierarchical identity-based encryption with efficient revocation
AU - Ryu, Geumsook
AU - Lee, Kwangsu
AU - Park, Seunghwan
AU - Lee, Dong Hoon
N1 - Funding Information:
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (No. 2010-0029121). The first two authors (Geumsook Ryu and Kwangsu Lee) equally contributed to this work
PY - 2016
Y1 - 2016
N2 - Hierarchical identity-based encryption (HIBE) is an extension of identity-based encryption (IBE) where an identity of a user is organized as a hierarchical structure and a user can delegate the private key generation to another user. Providing a revocation mechanism for HIBE is highly necessary to keep a system securely. Revocable HIBE (RHIBE) is an HIBE scheme that can revoke a user’s private key if his credential is expired or revealed. In this paper, we first propose an unbounded HIBE scheme where the maximum hierarchy depth is not limited and prove its selective security under a q-type assumption. Next, we propose an efficient unbounded RHIBE scheme by combining our unbounded HIBE scheme and a binary tree structure, and then we prove its selective security. By presenting the unbounded RHIBE scheme, we solve the open problem of Seo and Emura in CT-RSA 2015.
AB - Hierarchical identity-based encryption (HIBE) is an extension of identity-based encryption (IBE) where an identity of a user is organized as a hierarchical structure and a user can delegate the private key generation to another user. Providing a revocation mechanism for HIBE is highly necessary to keep a system securely. Revocable HIBE (RHIBE) is an HIBE scheme that can revoke a user’s private key if his credential is expired or revealed. In this paper, we first propose an unbounded HIBE scheme where the maximum hierarchy depth is not limited and prove its selective security under a q-type assumption. Next, we propose an efficient unbounded RHIBE scheme by combining our unbounded HIBE scheme and a binary tree structure, and then we prove its selective security. By presenting the unbounded RHIBE scheme, we solve the open problem of Seo and Emura in CT-RSA 2015.
KW - Bilinear maps
KW - Hierarchical identity-based encryption
KW - Identity-based encryption
KW - Revocation
KW - Unbounded hierarchy depth
UR - http://www.scopus.com/inward/record.url?scp=84962221107&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84962221107&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-31875-2_11
DO - 10.1007/978-3-319-31875-2_11
M3 - Conference contribution
AN - SCOPUS:84962221107
SN - 9783319318745
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 122
EP - 133
BT - Information Security Applications - 16th International Workshop, WISA 2015, Revised Selected Papers
A2 - Choi, Dooho
A2 - Kim, Ho-Won
PB - Springer Verlag
T2 - 16th International Workshop on Information Security Applications, WISA 2015
Y2 - 20 August 2015 through 22 August 2015
ER -