Paper Info
Title
Unbounded Hierarchical Identity-Based Encryption with Efficient Revocation.
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 useru0027s 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.
Year
DOI
Venue
2015
10.1007/978-3-319-31875-2_11
IACR Cryptology ePrint Archive
Field
DocType
Volume
Open problem,Computer science,Delegate,Computer security,Binary tree,Theoretical computer science,Revocation,Encryption,Hierarchy,Public-key cryptography,Credential
Journal
2015
Citations 
PageRank 
References 
0
0.34
19
Authors
4
Name
Order
Citations
PageRank
Geumsook Ryu100.34
Kwangsu Lee211720.83
Seunghwan Park332.48
Dong Hoon Lee42024192.87