|
In this thesis, two new authentication protocols are proposed.
In the first part, we present a four-message protocol for
initial authentication that supports subsequent authentication
in two messages without contacting the authentication server or
using synchronized clocks. This protocol has the property of
using fewer messages to provide better security than Kerberos
and better reliability and security than the NS and Permuted
protocols. Based on the protocol, a secure authentication
system is built, which uses the master-slave scheme. In the
second part, we propose a secure authentication protocol which
supports both the privacy of messages and the authenticity of
communicating parties in wireless networks. The trusted third
party (key information center) is not needed once the secure
network system is set up. Mutual authentication and key
distribution can be achieve with two messages merely between
two parties involved. With lower computation overhead, this
protocol resolves the problems, appeared in the Okamoto and
Tanaka's ID-based scheme, that user identities may be forged
and user secret information may be discolsed. It can also
protect user communication from replay attacks even if system
clocks are not synchronized.
|