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

Research output: Contribution to journalArticle

Colleges, School and Institutes

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.

Details

Original languageEnglish
Pages (from-to)463-472
Number of pages10
JournalInternational Journal of Computer Mathematics
Volume92
Issue number3
Early online date9 May 2014
Publication statusPublished - 2015

Keywords

  • decisional assumptions, generic model, hard problems, hierarchical identity-based encryption, standard model