Loading...
|
Please use this identifier to cite or link to this item:
http://140.128.103.80:8080/handle/310901/21912
|
Title: | The design of id-based access control system with time-sensitive key for mobile agent's migration |
Authors: | Liu, C.-H.a , Chung, Y.-F.b , Chen, T.-S.c , Wang, S.-D |
Contributors: | Department of Information Management, Tunghai University |
Keywords: | Access control;Bilinear pairings;Key management;Mobile agents;Time sensitive |
Date: | 2011 |
Issue Date: | 2013-05-15T09:07:34Z (UTC)
|
Abstract: | Due to the maturity of e-commerce and the ability of mobile agents to migrate freely in heterogeneous networks, mobile agents have become very popular for ecommerce applications in the distributed networks. However, once a user applies a mobile agent to execute his task on the Internet, the mobile agent exposes itself to danger. This is an obstacle when using mobile agents. It is, therefore, urgent to build up a secure structure for mobile agents. In this paper, a new structure is suitable for mobile agents on the basis of improving the tree-based scheme. In the novel structure, the concept of access control and a key assignment scheme are used to ensure the privacy of the data being transmitted. To convenient the computation in the key generation phase, we use the ID-based characteristics in bilinear pairings over elliptic curves to construct a hierarchical key management scheme. Moreover, the concept of time sensitive is integrated into our scheme, which ensures our scheme more secure and more efficient. Finally, from our security analysis, the new scheme should be able to resist malicious attacks, promote the key management efficiency and protect mobile agents. ? 2011 ICIC International. |
Relation: | International Journal of Innovative Computing, Information and Control Volume 7, Issue 12, December 2011, Pages 7077-7090 |
Appears in Collections: | [資訊管理學系所] 期刊論文
|
Files in This Item:
File |
Size | Format | |
index.html | 0Kb | HTML | 509 | View/Open |
|
All items in THUIR are protected by copyright, with all rights reserved.
|