Abstract
We propose efficient KEM and IBE schemes secure under the related-key attacks (RKAs) against almost all invertible related-key derivation (RKD) functions under the DBDH assumption. The class of RKD functions we consider is broader than the best known RKD function class: For example, the class contains polynomial functions of (bounded) polynomial degrees and the XOR functions simultaneously.
Author supplied keywords
Cite
CITATION STYLE
Fujisaki, E., & Xagawa, K. (2015). Efficient RKA-secure KEM and IBE schemes against invertible functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9230, pp. 3–20). Springer Verlag. https://doi.org/10.1007/978-3-319-22174-8_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
