Designing efficient authenticated key exchange resilient to leakage of ephemeral secret keys

18Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate a sufficient condition for constructing authenticated key exchange (AKE) protocols which satisfy security in the extended Canetti-Krawczyk (eCK) model proposed by LaMacchia, Lauter and Mityagin. To the best of our knowledge, this is the first approach for providing secure protocols based on the condition. With this condition, we propose a construction of two-pass AKE protocols, and the resulting two-pass AKE protocols are constructed with a single static key and a single ephemeral. In addition, the security proof does not require the Forking Lemma, which degrades the security of a protocol relative to the security of the underlying problem where it is used in the security proof. Therefore, these imply that the protocols constructed with the condition have an advantage in efficiency such as sizes of storage and communication data. The security of the resulting protocols is proved under the gap Diffie-Hellman assumption in the random oracle model. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fujioka, A., & Suzuki, K. (2011). Designing efficient authenticated key exchange resilient to leakage of ephemeral secret keys. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6558 LNCS, pp. 121–141). https://doi.org/10.1007/978-3-642-19074-2_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free