Abstract
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensible: currently there are no hierarchical or other known extension of IBE based on those schemes. In this work, we show that such extensions can be realized from IBE systems that conform to a certain abstraction of the exponent inversion paradigm. Our method requires no random oracles, and is simple and efficient. © International Association for Cryptology Research 2007.
Cite
CITATION STYLE
Boyen, X. (2007). General Ad Hoc encryption from exponent inversion IBE. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4515 LNCS, pp. 394–411). Springer Verlag. https://doi.org/10.1007/978-3-540-72540-4_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
