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, 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.
Type de document :
Article dans une revue
International Journal of Computer Mathematics, Taylor & Francis, 2014, 〈10.1080/00207160.2014.912278〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01011299
Contributeur : David Galindo <>
Soumis le : lundi 23 juin 2014 - 15:23:28
Dernière modification le : jeudi 11 janvier 2018 - 06:24:26

Identifiants

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〉

Partager

Métriques

Consultations de la notice

171