Font Size: a A A

Research On Anonymous Authentication And Key Distribution Protocol

Posted on:2013-11-18Degree:MasterType:Thesis
Country:ChinaCandidate:J Y CaoFull Text:PDF
GTID:2298330362467023Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
With the development of network and electronic technology, people can access theinternet by various devices. However, only with the help of the secure communicationprotocols, can people enjoy the convenience after the science and technologydevelopment. Among the secure communication protocols, anonymous authenticationprotocol and key distribution protocol are studied widely. Based on the previouspublications, the following researches are carried out.(1) In2009, X. F. Cao et al. proposed an anonymous remote authentication protocolfor value-added services in mobile networks. However, this protocol has some limitationsin efficiency and confidence level. Based on Diffie-Hellman (DH) key exchange protocolover the additive cyclic group, an improved anonymous remote authentication protocol isproposed, which combines smart card with user account, and does not need the trustedthird part except for the services provider. The improved protocol not only satisfies clientanonymity and non-repudiation, but also is more efficient than the previous.(2) In2007, Chang-Lin-Chen combined DH key exchange protocol over the finitefield with a sealed lock, and proposed a conference key distribution protocol by hidingunlock information with the interpolation polynomial. However, the protocol can notresist passive attacks. Based on DH key exchange protocol over the finite field and asealed lock, an improved conference key distribution scheme is proposed, which hasgood scalability, provides anonymity of the conference group members, and can preventpassive attacks, replay attacks and forgery attacks. With the improved protocol, the groupmembers can verify if they are invited to attend the conference. Compared with theprevious schemes, the protocol is less computational.(3) In2010, Harn-Lin proposed two group key transfer protocols, however whichcan not resist insider attacks, namely, an inside adversary can obtain the secret sharedbetween the other group member and the key generation center. A secure group keytransfer protocol is proposed to improve Harn-Lin’s protocol, which not only inherits theadvantages of the previous one, but also is against insider attacks.
Keywords/Search Tags:anonymous authentication, key distribution, bilinear pairing, interpolationpolynomial, Diffie-Hellman key exchange protocol
PDF Full Text Request
Related items