Design And Analysis Of Anonymous Authentication Protocol Based On Chebyshev Polynomial

Nowadays,a new application scenario caused by the rapid development of network technologies and applications is that users may need to frequently access multiple servers within a short time.However,the traditional authentication protocols require users to remember many passwords and establish multiple authentication sessions,which is a waste of time and resources.Moreover,this is also a heavy burden to the users.Besides,users' security awareness gradually improved,and they are paying more and more attention to their privacy because the identity information is easy to leak in the public channel.In the aspect of authentication efficiency,the selection of cryptographic algorithms has a great influence.Comparing with the widely used RSA and elliptic curve,the encryption system based on the Chebyshev polynomial achieves higher computing efficiency which is increasingly used in the design of authentication protocols.This thesis has carried on detailed researches on Chebyshev polynomials,single sign on and anonymous authentication protocols,the main works and the innovation points are as follows:1.Single-sign-on authentication protocols enable users to access various network services efficiently and conveniently.In order to provide more safely and efficient network services access,we proposed a new anonymous single-sign-on authentication protocol based on extended Chebyshev polynomials and also gave the security proof and the efficiency analysis of the proposed scheme.With the help of DH key exchange,mutual authentication can be realized quite conveniently with the public key and private key derived from identity.Comparing with other existing authentication protocols based on Chebyshev polynomials,the proposed authentication scheme has advantages in terms of security and efficiency.2.Multi-factor authentication protocols take advantage of smart card,user's password and biometrics,and consequently are more secure than the commonly used password-based single-factor authentication protocols.However,almost all the existed two-factor authentication protocols and multi-factor authentication protocols are based on smart cards,which will inevitably leads to a series of security problems due to the loss of smart cards.Recently,in order to solve these problems,Li et al.proposed a two-factor authentication protocol which does not need the user to bring a smart card.But we demonstrated that Li et al.'s protocol can't resist the privileged-insider attack and the stolen-verifier attack.Moreover,their protocol failed to provide user anonymity and didn't provide password update phase.To overcome the weaknesses of Li et al.'s scheme,we proposed an improved two-factor authentication protocol based on biometric feature and password using the extended Chebyshev polynomials,and then proved the security of the new protocol with formal analysis.Compared to other relevant authentication protocols,the proposed protocol can resist various attacks,provides the desired security features and has higher authentication efficiency.3.The existing multi-factor authentication protocols are rarely designed for the multi-server environment,and are hardly to fulfill the user's single sign on requirements.By combing the extended Chebyshev polynomials with the tickets,we proposed a novel multi-server multi-factor authentication protocol,which achieves anonymity and solves the problem that users have to establish multiple authentication sessions when users frequently access a variety of services within a short time.Finally,we proved the security of the proposed protocol with BAN logic and compared it with other multi-factor authentication protocols which are designed for the multi-server environment.The result shows that the proposed protocol is more efficient while achieving stronger security,and thus is more suitable for practical application.