@@ -225,3 +225,37 @@ @online{braundMRQEP2022
225
225
organization = { {MongoDB}}
226
226
}
227
227
228
+ @ARTICLE {Herranz2017-ze ,
229
+ title = " Attribute‐based encryption implies identity‐based encryption" ,
230
+ author = " Herranz, Javier" ,
231
+ abstract = " In this study, the author formally proves that designing
232
+ attribute-based encryption schemes cannot be easier than
233
+ designing identity-based encryption schemes. In more detail,
234
+ they show how an attribute-based encryption scheme which admits,
235
+ at least, and policies can be combined with a
236
+ collision-resistant hash function to obtain an identity-based
237
+ encryption scheme. Even if this result may seem natural, not
238
+ surprising at all, it has not been explicitly written anywhere,
239
+ as far as they know. Furthermore, it may be an unknown result
240
+ for some people: Odelu et al. in 2016 and 2017 have proposed
241
+ both an attribute-based encryption scheme in the discrete
242
+ logarithm setting, without bilinear pairings, and an
243
+ attribute-based encryption scheme in the RSA setting, both
244
+ admitting and policies. If these schemes were secure, then by
245
+ using the implication proved in this study, one would obtain
246
+ secure identity-based encryption schemes in both the RSA and the
247
+ discrete logarithm settings, without bilinear pairings, which
248
+ would be a breakthrough in the area. Unfortunately, the author
249
+ presents here complete attacks of the two schemes proposed by
250
+ Odelu et al." ,
251
+ journal = " IET Inf. Secur." ,
252
+ publisher = " Institution of Engineering and Technology (IET)" ,
253
+ volume = 11 ,
254
+ number = 6 ,
255
+ pages = " 332--337" ,
256
+ month = nov,
257
+ year = 2017 ,
258
+ copyright = " http://onlinelibrary.wiley.com/termsAndConditions\#vor" ,
259
+ language = " en"
260
+ }
261
+
0 commit comments