| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 92 === Abstract
Mobile Ad Hoc Networks (MANETs) are new generation networks offering unrestricted mobility without any underlying infrastructure such as base stations or mobile switching centers. In MANETs, all nodes share the responsibility of network formation and key management. As their principle applications are in catastrophic environments, such as military tactics and other security-sensitive operations, security is critical. One main challenge in the design of these networks is their vulnerability to security-attacks. For data security, cryptography is one of the most powerful tools in such network. In private-key cryptosystem (e.g. DES) and public-key cryptosystem (e.g. RSA), however, key management is a serious problem when the system includes many entities.
In this thesis, we present an ID-based key distribution system for the establishment of mutual trust and secure communication between nodes. The basic strategy of an ID-based key distribution system is based on an idea similar to that of ID-based cryptosystem and it is a very natural requirement for key management. The concept of an ID-based cryptosystem has been proposed by Shamir [2] in 1984. It is superior in not requiring for exchanging the public key or symmetric key, or keeping a large public-key file for such a system. The approach of this thesis is to develop the networks without any auxiliary preliminary communications for each message transmission on the assumption of the intractability of the discrete logarithm problem, i.e., the two communicating parties could implement authentication and key distribution without the support of the third party (e.g., CA). Furthermore, we develop a scalable security routing protocol by the ID-based cryptosystem based on the Cluster-Based Routing Protocol (CBRP), to reduce the number of flooding messages and hop count of routing paths and to achieve the goals of both security and efficiency.
|
|---|
