Cryptology ePrint Archive: Report 2019/917

Simplified Revocable Hierarchical Identity-Based Encryption from Lattices

Shixiong Wang and Juanyang Zhang and Jingnan He and Huaxiong Wang and Chao Li

Abstract: As an extension of identity-based encryption (IBE), revocable hierarchical IBE (RHIBE) supports both key revocation and key delegation simultaneously, which are two important functionalities for cryptographic use in practice. Recently in PKC 2019, Katsumata et al. constructed the first lattice-based RHIBE scheme with decryption key exposure resistance (DKER). Such constructions are all based on bilinear or multilinear maps before their work. In this paper, we simplify the construction of RHIBE scheme with DKER provided by Katsumata et al. With our new treatment of the identity spaces and the time period space, there is only one short trapdoor base in the master secret key and in the secret key of each identity. In addition, we claim that some items in the keys can also be removed due to the DKER setting. Our first RHIBE scheme in the standard model is presented as a result of the above simplification. Furthermore, based on the technique for lattice basis delegation in fixed dimension, we construct our second RHIBE scheme in the random oracle model. It has much shorter items in keys and ciphertexts than before, and also achieves the adaptive-identity security under the learning with errors (LWE) assumption.

Category / Keywords: public-key cryptography / Lattices, Identity-based encryption, Revocation, Delegation

Original Publication (with minor differences): CANS 2019 (The 18th International Conference on Cryptology and Network Security)

Date: received 11 Aug 2019

Contact author: wsx09 at foxmail com

Available format(s): PDF | BibTeX Citation

Version: 20190813:220648 (All versions of this report)

Short URL: ia.cr/2019/917


[ Cryptology ePrint archive ]