作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (7): 154-156. doi: 10.3969/j.issn.1000-3428.2008.07.054

• 安全技术 • 上一篇    下一篇

可证明安全的移动代理路由协议

田 旭1,刘仁金2,陈明华2   

  1. (1. 皖西学院现代教育技术中心,六安 237012;2. 皖西学院计算机科学与技术系,六安 237012)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-04-05 发布日期:2008-04-05

Provable Security Mobile Agent Routing Protocol

TIAN Xu1, LIU Ren-jin2, CHEN Ming-hua2   

  1. (1. Modem Education Technological Center, West Anhui University, Lu’an 237012; 2. Department of Computer Science & Technology, West Anhui University, Lu’an 237012)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-04-05 Published:2008-04-05

摘要: 针对移动代理路由安全问题,利用Hash函数单向性和迭代方法提出一种移动代理路由协议。用户主机通过Hash函数的单向性保证路由信息安全到达路由主机,路由主机之间根据Hash函数值的迭代进行交互认证。该协议的计算复杂度显著降低,特别是在大数据传输的情况下。采用常规方法和串空间模型方法分析并证明了该协议的安全性。

关键词: 移动代理, 迭代, 单向散列, 串空间, 计算复杂度

Abstract: A new mobile routing protocol using Hash function and iterative method is proposed in this paper for solving mobile agent routing security problems. User hosts are able to ensure routing information transporting to the others securely by the unidirectional feature of Hash function, and verify each other by the iteration of Hash function. The analysis shows that the computational complexity of the routing protocol is drastically reduced, especially in the condition of transporting large number of data. The normal and the strand space models are adopted to prove the security of the protocol.

Key words: mobile agent, iterative, Hash function, strand space, computational complexity

中图分类号: