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.
Highlights
User authentication is one of the first important parts in all remote services
When the wearable devices become popular, such as smart-glasses or smart-watch, a user wants to connect to remote service through these low-power computing devices
Lamport [1] is the pioneer using hash function with password. His method is a usage of password-table for user verification in login phase. This is a simple way and implemented, but his scheme is vulnerable to verification stolen attack, and inappropriately using password can result in offline password-guessing attack
Summary
User authentication is one of the first important parts in all remote services. after successful authentication, partners secretly exchange the messages to each other and we need a session key to encrypt all these messages. Yoon’s scheme has important improved ideas to isolate such problems They use password to authenticate with online server, so their scheme is still vulnerable to passwordrelated attacks. In 2015 Chaudhry et al [9] proposed an authentication scheme in multiserver environment with general public key cryptography (RSA or ECC). Chebyshev polynomial is an approach many authors pay attention to This method’s computational cost is more than ECC’s and it is being researched to be a standard such as RSA or ECC. In 2017, Wang and Xu [19] proposed a reference model to solve the offline dictionary attacks Their model is truly useful for designing many schemes with different approaches, such as RSA, ECC, or Chebyshev.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
