Protecting the computation results of free-roaming agents
When mobile agents do comparison shopping for their owners, they are subject to attacks of malicious hosts executing the agents. We present a family of protocols that protect the computation results established by free-roaming mobile agents. Our protocols enable the owner of the agent to detect upon its return whether a visited host has maliciously altered the state of the agent, thus providing forward integrity and truncation resilience. In an environment without public-key infrastructure, the protocols are based only on a secret hash chain. With a public-key infrastructure, the protocols also guarantee non-repudiability.
Unable to display preview. Download preview PDF.
- A. Chavez and P. Maes. Kasbah: An agent marketplace for buying and selling goods. In First International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, pages 75–90, 1996.Google Scholar
- G. Di Caro and M. Dorigo. Mobile agents for adaptive routing. In 31st Hawaii International Conference on System Science (HICSS-31), Big Island of Hawaii, January 6–9,1998.Google Scholar
- B. Doorenbos, O. Etzioni, and D. Weld. A scalable comparison-shopping agent for the world-wide web. In AGENTS-97, 1997.Google Scholar
- NIST National Institute of Standards and Technology (Computer Systems Laboratory). Secure hash standard. Federal Information Processing Standards Publication FIPS PUB 180-1, April 1995.Google Scholar
- D. Rus, R. Gray, and D. Kotz. Transportable information agents. In M. Huhns and M. Singh, editors, Readings in Agents. Morgan Kaufmann Publishers, 1997.Google Scholar
- G. Tsudik. Personal communication.Google Scholar
- G. Vigna. Protecting mobile agents through tracing. In Third Workshop on Mobile Object Systems, June 1997.Google Scholar
- J.E. White. Mobile agents. In J. Bradshaw, editor, Software Agents. AAAI Press and MIT Press, 1996.Google Scholar
- B.S. Yee. A sanctuary for mobile agents. Technical Report CS97-537, UC San Diego, Department of Computer Science and Engineering, April 1997.Google Scholar