Compact hierarchical identity-based encryption based on a harder decisional problem

David Galindo 1
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We generalize the decisional problem that was used to prove the security of a well-known hierarchical identity-based encryption scheme by Boneh, Boyen and Goh. We argue that our new problem is strictly harder than the original problem, and thus the security of the aforementioned cryptographic primitive is laid on even stronger foundations.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01011299
Contributor : David Galindo <>
Submitted on : Monday, June 23, 2014 - 3:23:28 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

Identifiers

Citation

David Galindo. Compact hierarchical identity-based encryption based on a harder decisional problem. International Journal of Computer Mathematics, Taylor & Francis, 2014, ⟨10.1080/00207160.2014.912278⟩. ⟨hal-01011299⟩

Share

Metrics

Record views

260