Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer Verlag |
| Pages | 122-133 |
| Number of pages | 12 |
| Volume | 9503 |
| ISBN (Print) | 9783319318745 |
| DOIs | |
| Publication status | Published - 2016 |
| Event | 16th International Workshop on Information Security Applications, WISA 2015 - Jeju Island, Korea, Republic of Duration: 2015 Aug 20 → 2015 Aug 22 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9503 |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 16th International Workshop on Information Security Applications, WISA 2015 |
|---|---|
| Country | Korea, Republic of |
| City | Jeju Island |
| Period | 15/8/20 → 15/8/22 |
Fingerprint
Keywords
- Bilinear maps
- Hierarchical identity-based encryption
- Identity-based encryption
- Revocation
- Unbounded hierarchy depth
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
Unbounded hierarchical identity-based encryption with efficient revocation. / Ryu, Geumsook; Lee, Kwangsu; Park, Seunghwan; Lee, Dong Hoon.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9503 Springer Verlag, 2016. p. 122-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9503).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Unbounded hierarchical identity-based encryption with efficient revocation
AU - Ryu, Geumsook
AU - Lee, Kwangsu
AU - Park, Seunghwan
AU - Lee, Dong Hoon
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
SN - 9783319318745
VL - 9503
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 122
EP - 133
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PB - Springer Verlag
ER -