Open AccessAttribute‐based encryption implies identity‐based encryption
Author(s) -
Herranz Javier
Publication year - 2017
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2016.0490
Subject(s) - encryption , probabilistic encryption , attribute based encryption , multiple encryption , 40 bit encryption , 56 bit encryption , theoretical computer science , discrete logarithm , functional encryption , scheme (mathematics) , mathematics , hash function , identity (music) , deterministic encryption , bilinear interpolation , computer science , computer security , public key cryptography , ciphertext , physics , acoustics , mathematical analysis , statistics
In this study, the author formally proves that designing attribute‐based encryption schemes cannot be easier than designing identity‐based encryption schemes. In more detail, they show how an attribute‐based encryption scheme which admits, at least, and policies can be combined with a collision‐resistant hash function to obtain an identity‐based encryption scheme. Even if this result may seem natural, not surprising at all, it has not been explicitly written anywhere, as far as they know. Furthermore, it may be an unknown result for some people: Odelu et al . in 2016 and 2017 have proposed both an attribute‐based encryption scheme in the discrete logarithm setting, without bilinear pairings, and an attribute‐based encryption scheme in the RSA setting, both admitting and policies. If these schemes were secure, then by using the implication proved in this study, one would obtain secure identity‐based encryption schemes in both the RSA and the discrete logarithm settings, without bilinear pairings, which would be a breakthrough in the area. Unfortunately, the author presents here complete attacks of the two schemes proposed by Odelu et al .