Chebyshev Polynomial-Based Authentication Scheme in Multiserver Environment

Toan-Thinh Truong,Anh-Duc Duong,Minh-Triet Tran

doi:10.1155/2020/3579705

Abstract

Nowadays, communication technologies are more and more strongly advanced, such as 4G or 5G. There are many useful online applications, and one of them is the telecare medical information system (TMIS). If the TMIS is widely deployed, patients and doctors will have more frequently connection. Clearly, this enhances our quality of life. One of the most important modules securely constructing this convenient TMIS is the user-authentication scheme. We should prevent user identity and related information from the adversary’s eavesdropping. Therefore, the authentication scheme could provide user anonymity and concern some kinds of attacks, such as impersonation or password-guessing attacks. Common solutions are a combination of hash function and public-key cryptosystem (RSA or elliptic curve cryptosystem, ECC), but current schemes do not consider identity protection as one main task necessary for medical information environment. In this paper, our results consist of some important analyses of previous works and a multiserver user-authentication scheme suitable for TMIS using Chebyshev polynomial with two models: random oracle and BAN-logic.

Highlights

With evolutionary changes in technological fields, all aspects of modern life are influenced positively, especially in medical online-service systems
The user and server must know if their partner is real or fake
We should design an authentication scheme combined with some cryptographic primitives and hard problems to resist some common kinds of attacks

Summary

Introduction

With evolutionary changes in technological fields, all aspects of modern life are influenced positively, especially in medical online-service systems. We need to propose an efficient scheme to overcome some existing limitations To achieve this goal, we should design an authentication scheme combined with some cryptographic primitives and hard problems to resist some common kinds of attacks. In 2014, Qu and Tan [12] proposed a different ECC-based scheme They used elliptic curve cryptosystem, leaking the user’s identity may result in impersonation attack. In 2016, Li et al [17] proposed a chaotic map-based authentication scheme in multiserver environment with provable security. We will analyse typical works [11,12,13, 18, 20, 21] to have some information needed to propose a new Chebyshev polynomial-based scheme in multiserver environment.

Background

Security and Efficiency Analyses