| With the rapid development of technologies,the Internet plays an important role in our life,as we know,the Internet is a complicated and open place,so the security of Internet protocol has attracted more and more attention from the scholars and researchers,and they did a great job in researching secure and efficient protocols.Nowadays we can enjoy more and more kinds of services from the Internet,single-factor passwords are no longer meet our need of secure,so multi-server authentication and biometrics authentication are more and more applied,with the growth of using of mobile terminal,designing a secure protocol applicable in mobile terminal is in great need.Authentication protocols based on Chebyshev polynomials are more efficient than those based on traditional public key architecture,more and more achievements were made in this field.This paper mainly studies multi-server biometrics authentication protocols based on Chebyshev polynomials.After briefly reviewing Zhang's scheme,we pointed out that there are some problems like it can't provide user anonymity,is vulnerable to denial of service attack,and so on.Then we proposed a new authentication protocol based on Chebyshev polynomials,it is secure to frequent kinds of attack,and it has the advantage over Zhang's scheme at security and efficiency.We also proposed an authentication key agreement scheme,so that our protocol is more suitable for the Internet.The main contents of this paper are arranged as follows:In Chapter 1,we introduce the development of protocols based on Chebyshev polynomials.In Chapter 2,we introduce the basics of this paper.In Chapter 3,we review Zhang's scheme and point out some problems of his paper.In Chapter 4,we propose a new authentication protocol to solve the problems exist in Zhang's schemeIn Chapter 5,we prove the security and practicability of our protocol.In Chapter 6,we propose a new key agreement protocol and analyze its security.In Chapter 7,we briefly summarize this paper. |
PDF Full Text Request