Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions

Conference paper

DOI: 10.1007/978-3-319-22174-8_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9230)
Cite this paper as:
Fujisaki E., Xagawa K. (2015) Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions. In: Lauter K., Rodríguez-Henríquez F. (eds) Progress in Cryptology -- LATINCRYPT 2015. LATINCRYPT 2015. Lecture Notes in Computer Science, vol 9230. Springer, Cham


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.


Related-key attack security Invertible related-key derivation functions 

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.NTT Secure Platform LaboratoriesTokyoJapan

Personalised recommendations