Improved Chebyshev Polynomials-Based Authentication Scheme in Client-Server Environment

• Published in: Security and communication networks 2019-01, Vol.2019 (2019), p.1-11
• Main Authors: Truong, Toan-Thinh, Duong, Anh-Duc, Tran, Minh-Triet
• Format: Article
• Language: English
• Subjects: Authentication; Chebyshev approximation; Cryptography; Data encryption; Encryption; Passwords; Physicians; Polynomials; Prime numbers; Registration; Security; Servers
• ISSN: 1939-0114; 1939-0122
• DOI: 10.1155/2019/4250743

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.