A communication and computation‐efficient three‐party authenticated key agreement protocol. Issue 7 (29th August 2012)

• Record Type: Journal Article
• Authors: Tan, Zuowen
• Is Part Of: Security and communication networks. Volume 6:Issue 7(2013:Jul.)
• Page Start: 854
• Page End: 863
• Publication Date: 2012-08-29
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.622
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main"> <title>ABSTRACT</title> <p>The three‐party authenticated key agreement protocol enables two clients to authenticate each other and agree on a session key over an insecure public network with the help of a trusted server. The password‐based three‐party authenticated key agreement protocols often have two drawbacks: (1) the server must store large numbers of passwords and (2) low‐entropy passwords easily suffer from potential guessing attacks. The public key infrastructure‐based three‐party authenticated key agreement protocols need no password. In 2008, Chen <italic>et al</italic>. proposed a round‐efficient three‐party authenticated key agreement protocol that needs no password or public key cryptosystem. However, the computation costs and communication loads of their protocol are still high. In 2009, Yang <italic>et al</italic>. proposed an efficient three‐party authenticated key exchange protocol based upon elliptic curve cryptography for mobile commerce environments. Unfortunately, both three‐party authenticated key agreement protocols are insecure. In this paper, we propose a novel three‐party authenticated key agreement protocol that requires neither public key cryptosystem nor password. Compared with the previous three‐party authenticated key agreement protocols, the novel three‐party authenticated key agreement protocol requires considerably fewer rounds, lower communication cost and smaller computation cost. The comparisons have shown that our three‐party authenticated key agreement protocol is more practical than other three‐party authenticated key agreement protocols. The proposed protocol is provably secure on the basis of the intractability of the computational Diffie–Hellman problems in the random oracle model. Copyright © 2012 John Wiley & Sons, Ltd.</p> </abstract>