English  |  正體中文  |  简体中文  |  Items with full text/Total items : 21921/27947 (78%)
Visitors : 4238024      Online Users : 448
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://140.128.103.80:8080/handle/310901/21847


    Title: Efficient date-constraint access control and key management scheme for mobile agents
    Authors: Chung, Y.-F.a , Kao, M.-H.a, Chen, T.-L.b, Chen, T.-S.
    Contributors: Department of Information Management, Tunghai University
    Keywords: Access control;Date-constraint key management;Elliptic curve cryptosystem;Key management;Mobile agent
    Date: 2010-03-17
    Issue Date: 2013-05-15T09:06:44Z (UTC)
    Publisher: Kowloon; Hong Kong
    Abstract: A mobile agent has become a competent software nowadays because of its significant abilities. It can roam freely in different Internet environments, adapt itself to various types of online servers totally associated to the characteristics of said server, and detect its environment and automatic adaptation to the environment while executing the assigned tasks by users. Due to these competencies, mobile agents have been widely used in Internet business, wireless communications, information security technologies and so forth. In 1983, Akl and Taylor suggested the concept of super-key to resolve the key management issues. It's the kind of thing where a mobile agent faces. Thus in 1998, Volker and Mehrdad proposed a tree-based mobile agent model to deal with the access control problem. The proposed scheme is based upon Elliptic Curve Cryptosystem (ECC), which enhances the operational ability of a mobile agent because of shorter key length and higher efficiency on encryption and decryption processes. For a mobile agent, a said user will be forced to log out of the system due to error or change in the user's rights or after a period of time. As is the case, the system must keep modifying the original access rights of the key so as to prevent a user from continuing to use his old key. However, this action could cause unnecessary error and risks, in addition to the large amount of computations that the system needs to perform. Hence, this paper proposes a Date-constraint key management scheme, where a date is attached to a key, so as to give its validity period of the key. Thus, key management can be more efficient.
    Relation: Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010
    2010, Pages 252-257
    Appears in Collections:[資訊管理學系所] 會議論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML327View/Open


    All items in THUIR are protected by copyright, with all rights reserved.


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback