An Improved Free-Roaming Mobile Agent Security Protocol against Colluded Truncation Attacks

This paper proposes an improved free-roaming mobile agent security protocol. The scheme uses "one hop backwards and two hops forwards" chain relation as the protocol core to implement the generally accepted mobile agent security properties. This scheme defends most known attacks, especially colluded truncation attacks and several special cases

[1]  N. Asokan,et al.  Protecting the computation results of free-roaming agents , 2005, Personal Technologies.

[2]  C. Stefanelli,et al.  Mobile agents protection in the Internet environment , 1999, Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032).

[3]  Ed Dawson,et al.  An Improved Forward Integrity Protocol for Mobile Agents , 2003, WISA.

[4]  Javier López,et al.  Analysis of a free roaming agent result-truncation defense scheme , 2004, Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004..

[5]  Victor K.-W. Wei,et al.  Defenses against the Truncation of Computation Results of Free-Roaming Agents , 2002, ICICS.

[6]  Volker Roth,et al.  On the Robustness of Some Cryptographic Protocols for Mobile Agent Protection , 2001, Mobile Agents.

[7]  Bennet S. Yee.  A Sanctuary for Mobile Agents , 2001, Secure Internet Programming.

[8]  Jianying Zhou,et al.  Protecting free roaming agents against result-truncation attack , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[9]  Suphithat Songsiri.  A new approach for computation result protection in the mobile agent paradigm , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[10]  Anand R. Tripathi,et al.  Security in the Ajanta mobile agent system , 2001, Softw. Pract. Exp..