Summary: | 博士 === 國立中正大學 === 資訊工程研究所 === 99 === With the development of network technologies, network communications have become a part for many people’s daily lives. Either wired or wireless networks have become the most popular medium for data transmission and communications. People enjoy the use of many applications in network environments, such as Internet commerce, electronic mail (E-mail), and voice over IP (VoIP). Since there is no face-to-face interaction between people who are using networks, providing secure communications in which they can authenticate each other with confidence and in which others can be prevented from eavesdropping on or tampering with transmitted data is a very challenging task.
It is well known that user authentication and data confidentiality are the two most important issues for secure communications. To achieve the objectives of authentication and confidentiality, the scope of my thesis is focused on the following research topics: (1) developing secure and efficient authenticated key agreement schemes; (2) developing solutions to protect the privacy of remote users; (3) developing user-friendly log-in mechanisms for different service providers; (4) developing a scheme to provide anonymous roaming in the global mobility network (GLOMONET); and (5) developing secure E-mail protocols for mobile devices.
In this thesis, we analyze common security requirements for various applications and investigate related works in the current literature. We propose several mutual authentication protocols with session key establishment. These protocols can verify the legitimacy of the communicating parties and protect the confidentiality of transmitted data. In addition, we propose a secure E-mail protocol with perfect forward secrecy for mobile devices. Most of our proposed authentication schemes use low cost functions, such as one-way hash functions and exclusive-OR operators, to decrease the client’s computational cost. Also, instead of using time-synchronized mechanisms, our proposed schemes use random nonces to simply their implementation. Therefore, our schemes can be implemented easily in various network environments, reducing the overhead associated with the construction of the systems.
|