基于移动代理的可变路由安全协议  

Flexible Itinerary Protection Based on Mobile Agents

作　　者：柳毅[1] 伍前红[1] 王育民[1] 

机构地区：[1]西安电子科技大学综合业务网国家重点实验室,西安710071

出　　处：《计算机学报》2005年第7期1118-1122,共5页Chinese Journal of Computers

基　　金：国家自然科学基金(19931010);国家"八六三"高技术研究发展计划项目基金(2002AA143021)资助

摘　　要：移动代理是一种软件程序,它漫游在计算机网络中,经过不同的主机代替用户执行一定的任务,但是它也带来了许多新的有关面临恶意代理与主机安全的问题.路由安全就是移动代理技术面临的主要安全问题之一.通过对已有的移动代理路由方案的分析,可以得出Mir等给出的基于嵌套加密的移动代理安全路由方案是目前计算复杂度最低的方案.基于基本签字加密技术,该文利用Hash函数提出了一个安全高效的移动代理路由协议,并对其安全性和计算复杂度进行了详细的分析.相比Mir等的方案,该协议在保证安全性的同时,计算复杂度得到了显著的降低,使得用户和路由主机的计算复杂度均达到O(n).Mobile agents are autonomous software entities that are able to migrate across different execution environments. Mobility and autonomy make permanent connections unnecessary. Mobile agents architecture can bring many potential benefits such as great flexibility and improved performance into distributed systems. Therefore, they are believed to be playing an important role in future electronic commerce systems. However, mobile agents also create many new security threats from malicious agents and hosts. Route protection is one of security problems mobile agents have to face. Itineraries may be viewed as an specification or plan of mobile a-gents movements. A community of mobile agents is considered to implement the movement plan correctly, if their observed behavior corresponds to the plan. In this paper, route protections of mobile agents existed are introduced and compared firstly. A conclusion can be made that a protocol based on nested encryptions is the best. After that, based on atomic encryptions and signatures, authors use Hash function to present a effective itinerary protection of mobile agents. And its security and computational overhead are analyzed in detail. The results show that the protocol satisfies a set of general security properties for mobile agents route protection and reduces the computational complexity of route protection to O(n) compared with the one based on nested encryptions.

关 键 词：移动代理 基本签字加密 嵌套加密 计算复杂度 可变路由 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]