Defend mobile agent against malicious hosts in migration itineraries

Agent integrity verification and fault-tolerance are the two prevalent methods among the solutions to the Problem of Malicious Hosts in Mobile agent system. Agent integrity verification enables the owner of the agent to detect upon its return whether a visited host has maliciously altered the state of the agent based on agent integrity verification [6]. A known drawback of such method is that it cannot detect the tampering of agent immediately, and the tampering can be detected only when the agent returned. Agent fault-tolerance is one method that achieves agent fault-tolerance in migration itineraries by agent replication and majority voting [11]. The drawback of such method is that the agent replication and majority voting can produce many agent replicas in every agent migration step, which may cost significant resource and time. Aiming at those drawbacks, the paper incorporates the two methods, and presents a novel agent migration fault-tolerance model based on integrity verification, which can defend mobile agent against malicious hosts in migration itineraries effectively. The novel agent fault-tolerance model cannot only realize the fault-tolerant execution, but also reduce the complexity and resource cost of agent migration communication.

[1]  Fred B. Schneider,et al.  Towards Fault-Tolerant and Secure Agentry , 1997, WDAG.

[2]  Fritz Hohl,et al.  Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts , 1998, Mobile Agents and Security.

[3]  Robbert van Renesse,et al.  Cryptographic support for fault-tolerant distributed computing , 1996, EW 7.

[4]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[5]  Cornelia Boldyreff,et al.  Mobile agent fault tolerance for information retrieval applications: an exception handling approach , 2003, The Sixth International Symposium on Autonomous Decentralized Systems, 2003. ISADS 2003..

[6]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

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

[8]  Fritz Hohl,et al.  A protocol to detect malicious hosts attacks by using reference states , 1999 .

[9]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[10]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[11]  Shambhu Upadhyaya,et al.  Secure and fault-tolerant voting in distributed systems , 2001, 2001 IEEE Aerospace Conference Proceedings (Cat. No.01TH8542).

[12]  Giovanni Vigna,et al.  Mobile Agents and Security , 1998, Lecture Notes in Computer Science.

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

[14]  Michael J. Grimley,et al.  Protecting the integrity of agents: an exploration into letting agents loose in an unpredictable world , 1999, CROS.

[15]  Riccardo Sisto,et al.  Experiments on Formal Verification of Mobile Agent Data Integrity Properties , 2002, WOA.

[16]  Joachim Parrow,et al.  An Introduction to the π-Calculus , 2001, Handbook of Process Algebra.

[17]  David M. Chess,et al.  Security Issues in Mobile Code Systems , 1998, Mobile Agents and Security.

[18]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[19]  William M. Farmer,et al.  Security for Mobile Agents: Authentication and State Appraisal , 1996, ESORICS.

[20]  E. C. Vijil.  Identifying collusions : Co-operating malicious hosts in mobile agent itineraries , 2002 .

[21]  Shiyong Zhang,et al.  The Construction and Analysis of Agent Fault-Tolerance Model Based on pi-Calculus , 2004, International Conference on Computational Science.

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

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

[24]  André Schiper,et al.  Fault-Tolerant Mobile Agent Execution , 2003, IEEE Trans. Computers.