An efficient ID-based authenticated key agreement protocol with pairings

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

Abstract

In 2003, Shim proposed an efficient ID-based authenticated key agreement protocol based on Weil pairings [1]. Sun et al. raised the potential of a man-in-the-middle attack in [2], In 2004, Ryu et al. proposed an efficient ID-based authenticated key agreement protocol from pairings [3], In 2005, however, Boyd et al. noted security problems of Ryu et al.'s protocol in [4]. In 2005, Yuan et al. also pointed out the same weakness [5] in Ryu et al.'s protocol. Then, they proposed a new protocol that combines Ryu et al.'s protocol with Shim's protocol. In this paper, we demonstrate that Shim's protocol does not provide KGC forward secrecy, then we propose a more efficient and secure protocol which does provide such security. As a result, our protocol does not need an additional ECC point-addition unlike Yuan et al.'s protocol and our's can generate two secure session key to perform the secure message transmission. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Oh, J. B., Yoon, E. J., & Yoo, K. Y. (2007). An efficient ID-based authenticated key agreement protocol with pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4742 LNCS, pp. 446–456). Springer Verlag. https://doi.org/10.1007/978-3-540-74742-0_41

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