Efficient Access Control and Key Management for Mobile Agents

• Main Authors: Chun-Hsu Huang, 黃君旭
• Other Authors: Wei-Bin Lee
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/73747443919624679179

碩士 === 逢甲大學 === 資訊電機工程碩士在職專班 === 94 === The mobile agent is designed for roaming around the internet and to achieve the goal of autonomy. With rapid growth of internet application, it will become a new promising technique. There are many application paradigms about mobile agents had proposed. However, a lot of security issues arose continuously. Security is still a fundamental precondition for the application of mobile agent systems. In order to enable the mobile agent to travel through the internet in safety, a suitable access control mechanism is indispensable to mobile agents. Volker and Mehrdad have proposed a tree-based structure that supports key management and access control for mobile agents. However, a large amount of storage for storing the secret keys is required in their scheme. Lin, Ou and Hwang proposed a RSA-based hierarchy structure to improve the drawbacks of Volker and Mehrdad’s scheme. The schemes of Lin-Ou-Hwang could reduce some of the mobile code, but still suffer from high computational cost. If the network service host has many mobile agents visited in the meantime; or the mobile agent is applied in mobile devices, these cases above-mention will diminish the efficiency and facility in application of mobile agents. In this paper, we propose an efficient hierarchy structure based on CRT (Chinese Remainder Theorm) for access control and key management for mobile agents. Our analysis shows that not only does our security match previous requirements but also reduce the computational cost of deriving secret keys significantly, so it is quite obvious that our scheme is more efficient than previous schemes.