In the distributed computing environments such as wireless network, the key exchange protocol with mutual authentication is critical to the following secure sessions between communicators and more attentions are paid to the provability of the protocol security. A mutual authentication key agreement protocol, MAKAP (mutual authenticated key agreement protocol) is proposed. The security of the protocol is proved in Bellare-Rogaway's model and its computation cost is also analyzed. MAKAP has advantages over other protocols in its security provability and only spends moderate computation cost, so it is quite practical.
[1]Wong DS, Chan AH. Mutual authentication and key exchange for low power wireless communications. In: Edmonds A, Yenser G, Ferrari G, eds. Proceedings of the IEEE MILCOM 2001 Conference. Washington DC: IEEE Communication Society, 2001. 39~43.
[2]Jakobsson M, Pointcheval D. Mutual authentication for low-power mobile devices. In: Syverson PF, ed. Proceedings of the Financial Cryptography 2001. Heidelberg: Springer-Verlag, 2001. 178~195.
[3]Bellare M, Rogaway P. Entity authentication and key distribution. In: Stinson DR, ed. Proceedings of the CRYPTO'93. Lecture Notes in Computer Science Vol.773, Heidelberg: Springer-Verlag, 1994. 232~249.
[4]Bellare M, Rogaway P. Provably secure session key distribution-the three party case. In: Leighton FT, Borodin A, eds. Proceedings of the 27th ACM Symposium on Theory of Computing. Las Vegas: ACM, 1995. 57~66.
[5]Lee SW, Hong SM, Yoon HS, Cho YK. Accelerating key establishment protocols for mobile communication. In: Pieprzyk J, Safavi-Naini R, Seberry J, eds. Information Security and Privacy, Proceedings of the 4th Australasian Conference, ACISP'99 Proceedings. Lecture Notes in Computer Science, Vol.1587, Heidelberg: Springer-Verlag, 1999. 51~63.