Remote mutual authentication provides an efficient platform through which an user accesses several resources of the remote serve at anytime over insecure channel and makes their life more comfortable. In this context, lot of key agreement methods have been put forward for enhancing securities. Preserving complete security requirements of the authentication scheme are now becoming challenging research. Hsu et al. proposed similar type of work using bilinear pairing for improving the security weaknesses of the Fang’s scheme, and Das et al.’s scheme. We have studied Hsu et al.’s scheme and pointed out that the scheme is ill-suited since off-line password guessing and new smartcard issue attacks are possible in this scheme. It is our further study that Hsu et al.’s scheme is not preserving session key negotiation and mutual authentication. The same problems also exist in Fang’s scheme and Das et al.’s scheme. The objective of this article is to provide an efficient scheme, which resolves all the existing problems. The AVISPA simulation results on our scheme ensured that active and passive attacks are protected. The informal security discussion claims that the scheme resists all kinds of security attacks. We have shown that the performance of our scheme is relatively superior in comparison with existing works. As an application area, anyone can execute our protocol in multimedia big data environment for making secure connection between the client and server.
Amin, R., Hafizul Islam, S. K., Vijayakumar, P., Khan, M. K., & Chang, V. (2018). A robust and efficient bilinear pairing based mutual authentication and session key verification over insecure communication. Multimedia Tools and Applications, 11041–11066 . https://doi.org/10.1007/s11042-017-4996-z