Provably Efficient Authenticated Key Agreement Protocol for Multi-Servers

Abstract

An efficient and practical authenticated key agreement protocol based on the line of geometry is proposed in this paper. It is a good solution to provide authentication and confidentiality. Identity authentication and message confidentiality are two important issues for the open network environment. In the proposed protocol, the authorized user can access multi-servers securely by keeping only a weak password and a smart card. Owing to the limited memory of the smart card, the secret information stored in the smart card has a size independent of the number of servers to which it connects. The proposed protocol provides mutual authentication between the user and the server and enables them to establish a common session key to provide message confidentiality for each other. It can also resist the replay attack, the impersonation attack, the off-line dictionary attack, the known key attack, the unknown key share attack, the stolen verifier attack and the insider attack. The security of the proposed protocol will be demonstrated by the random oracle model. Furthermore, we use the logic analysis method to analyze the proposed protocol. This protocol does not use any overload cryptographic operations and requires less communicational and computational costs than the results obtained previously from the existing scholarship.

Chaotic map‐based three‐party authenticated key agreement

“…In 2005, Lee et al [13] proposed a three-party verifier-based key agreement protocol in which the server's public key is unnecessary to be involved in the key exchange procedure. So far, lots of key agreement protocols [14][15][16][17][18][19][20][21][22] have been proposed.…”

An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services

“…However, the property of impersonation resistance was not much treated in [6]. Both Juang [10] and Hwang & Shiau [9] proposed authentication systems in multi-service environment with smart cards which satisfy memory efficiency. However, these systems cannot achieve unlinkability in multi-service environment.…”