[Resource Topic] 2015/827: Unbounded Hierarchical Identity-Based Encryption with Efficient Revocation

Welcome to the resource topic for 2015/827

Title:
Unbounded Hierarchical Identity-Based Encryption with Efficient Revocation

Authors: Geumsook Ryu, Kwangsu Lee, Seunghwan Park, Dong Hoon Lee

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.

ePrint: https://eprint.iacr.org/2015/827

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .