Compact hierarchical identity-based encryption based on a harder decisional problem
Research output: Contribution to journal › Article
Colleges, School and Institutes
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.
|Number of pages||10|
|Journal||International Journal of Computer Mathematics|
|Early online date||9 May 2014|
|Publication status||Published - 2015|