Double Secret Keys and Double Random Numbers Authentication Scheme
-
Graphical Abstract
-
Abstract
The computer network is an open system, and it leads to considerable security vulnerabilities and security threats in computer network. The network resources can easily be visited and illegally copied. So the identity authentication of the Web source visitor has become very important. In 1981, Lamport proposed an authentication scheme based on keywords table. This scheme can resist the replay attack, but will be not in security when the password stored in the host is attacked. Smart card can be more available to identity authentication. Many authentication schemes based on smart card are proposed for improving authentication efficiency and security. Firstly, Manik Lal Das’s authentication scheme is analyzed detailedly in this paper. It has time synchronization problem and vulnerable forgery attack. So, mutual authentication scheme based on bilinear pairings which is using smart card is proposed. A novel technique of using double secret keys and double random numbers for preventing forgery attack in authentication process is proposed. It enhances the security of the authentication system and accomplishes mutual authentication safely between the user and the remote system. Finally, the scheme finishes the correctness attestation, and security and computation complexity analysis.
-
-