An anonymous authenticated key-agreement scheme for multi-server infrastructure

Abstract

Due to single-time registration, the multi-server authentication provides benefit for getting services from different servers through trusted agent. Generally, users feel hesitation for registering themselves individually with all service providers due to the problem of memorizing the multiple passwords. The multi-server authentication allows a quick access to services by real-time customer validation on public channel. Thereafter, hundreds of multi-server authentication protocols have been introduced. However, the more efficient and robust authentication schemes are being explored by the research academia. We introduce an anonymous scheme that resists the major security threats like impersonation attack, insider attack and password modification attacks in viable computing cost. We use random oracle model for formal security analysis of the proposed scheme. The performance analysis shows that the proposed scheme incurs less computation, energy, communication and storage cost as compared to related protocols. This analysis and comparison show that our proposed scheme is quite effective for the purpose of anonymous authentication and key agreement.

SELAMAT: A New Secure and Lightweight Multi-Factor Authentication Scheme for Cross-Platform Industrial IoT Systems

“…However, we found that this AKE device is vulnerable to a temporary secret attack [ 20 ]. M. Akram et al [ 32 ] enhanced the security features by proposing an anonymous three-factor authentication scheme for multi-servers. The scheme designed was based on the elliptic curve cryptography, and the biometric information is verified by the user and the server separately.…”

“…Here, we explain the comparison of the communication cost and the computation cost of the proposed scheme with other existing schemes [ 20 , 26 , 31 , 32 ] which are shown in Table 5 . The performance metrics can be explained as follows.…”

“…In this subsection, we analyze the computation cost of the related authentication schemes SAKA-FC [ 26 ], SAKE [ 20 ], AKA-FC [ 31 ], and AKA-MS [ 32 ] and our proposed scheme. The number of cryptographic operations involved in this study are counted.…”

“…Therefore, the total execution time in the SAKE scheme is 45.055 ms. The AKA-MS scheme [ 32 ] uses two cryptographic operations: hash operation related to bilinear pairing and hash operation related to the group of ECC . The estimated execution times are 12.418 and 0.974 ms, individually.…”

Permissionless proof‐of‐reputation‐X: A hybrid reputation‐based consensus algorithm for permissionless blockchains

“…To discover the private key of any node, an attacker must compromise all nodes involved in the threshold PKG. Notice that many other key management schemes were proposed in the literature, one can cite 85 …”