Open AccessUnbounded and revocable hierarchical identity-based encryption with adaptive security, decryption key exposure resistant, and short public parameters
Author(s) -
Qianqian Xing,
Baosheng Wang,
Xiaofeng Wang,
Jing Tao
Publication year - 2018
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0195204
Subject(s) - computer science , encryption , key (lock) , scheme (mathematics) , scalability , bounded function , delegation , revocation , public key cryptography , computer security , vulnerability (computing) , resilience (materials science) , hierarchy , theoretical computer science , distributed computing , overhead (engineering) , mathematics , mathematical analysis , database , political science , economics , law , market economy , operating system , physics , thermodynamics
Revocation functionality and hierarchy key delegation are two necessary and crucial requirements to identity-based cryptosystems. Revocable hierarchical identity-based encryption (RHIBE) has attracted a lot of attention in recent years, many RHIBE schemes have been proposed but shown to be either insecure or bounded where they have to fix the maximum hierarchical depth of RHIBE at setup. In this paper, we propose a new unbounded RHIBE scheme with decryption key exposure resilience and with short public system parameters, and prove our RHIBE scheme to be adaptively secure. Our system model is scalable inherently to accommodate more levels of user adaptively with no adding workload or restarting the system. By carefully designing the hybrid games, we overcome the subtle obstacle in applying the dual system encryption methodology for the unbounded and revocable HIBE. To the best of our knowledge, this is the first construction of adaptively secure unbounded RHIBE scheme.