Improved chebyshev polynomials-based authentication scheme in client-server environment

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With nonstop development of communication technologies, all aspects of social life continuously change and so do network systems. When establishing connection is easy, the convenience of online-service receives many users' attentions, for example, the patients directly access medical system to be advised by doctors at any time. Therefore, user authentication scheme is necessary when we want to provide privacy and security for working sessions. Storing a password list for verification is an old method and not secure. This list can be easily leaked, and adversary can launch an offline password-guessing attack. In addition, information exchanged between user and server needs being prevented from attacker's decryption. It can be said that current authentication schemes are unsuitable for new security standard. We need a strong user authentication scheme using new approach to overcome existing limitations and guarantee time efficiency. In this paper, we make a design with Chebyshev polynomial to achieve our goals and resist some kinds of attacks.

Cite

CITATION STYLE

APA

Truong, T. T., Tran, M. T., & Duong, A. D. (2019). Improved chebyshev polynomials-based authentication scheme in client-server environment. Security and Communication Networks, 2019. https://doi.org/10.1155/2019/4250743

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free