We introduce a formal model for certificateless authenticated key exchange (CL-AKE) protocols. Contrary to what might be expected, we show that the natural combination of an ID-based AKE protocol with a public key based AKE protocol cannot provide strong security. We provide the first one-round CL-AKE scheme proven secure in the random oracle model. We introduce two variants of the Diffie-Hellman trapdoor introduced by [4]. The proposed key agreement scheme is secure as long as each party has at least one uncompromised secret. Thus, our scheme is secure even if the key generation centre learns the ephemeral secrets of both parties. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Lippold, G., Boyd, C., & Gonzalez Nieto, J. (2009). Strongly secure certificateless key agreement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5671 LNCS, pp. 206–230). https://doi.org/10.1007/978-3-642-03298-1_14
Mendeley helps you to discover research relevant for your work.