Font Size: a A A

Research And Application Of Self-certified Authentication

Posted on:2008-12-23Degree:MasterType:Thesis
Country:ChinaCandidate:D W ZhangFull Text:PDF
GTID:2178360212995658Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Network information security is very closely bound up with the life of the publics and the societal economy within both computer network and PC , along with the use of computer and the development of network communication are permeating the society in hard speed. Network information security is too one vital strategy fields to every country. Identity authentication is a important sector of information security, and always is the begin of secure communication in one open environment. Self-certified authentication protocol that is one of identity authentications can compensate some weaknesses of certificate-based and identity-based public-key authentication framework, and recently are used in the other research domains by many researchers.This article firstly introduces some primary theories and HARD problems on which the two new self-certified authentication schemes depend, then describes carefully and analyses the main technologies and categories, including password identification, challenge-response identification, and interactive zero-knowledge proof. We not only explain the main idea of every category but also the different of each other.This article emphasizes the interactive zero-knowledge proof, and makes a careful show about Girault self-certified scheme used in identification. This thesis introduces two new efficient self-certified identification which based on the idea of Griault self-certified , one is can be used in smart cards, which makes use of Blum integer into Rabin signature scheme. The other is can be used in open insecure environment of communications between several remote users while achieving Authenticated Key Exchange, which employ schnorr-like signature scheme to achieve the unforgeability between users and Trent (trusted third party). This scheme makes use of KEA+ protocol which based on CDH problem to achieve AKE. That is, it makes the session key which used in the next interactive plan. Lastly, the article introduces some algorithms of several vital parameters in two schemes.
Keywords/Search Tags:Authentication, Self-certified, interactive zero-knowledge, Discrete Logarithms, Factoring
PDF Full Text Request
Related items