Abstract
In the world of mobile agents, security aspects are extensively being discussed. In this context, denial of service (DoS) attacks are of considerable interest where the focus is on malicious hosts that either delete received agents or prevent them from continuing their route. This paper discusses a detection method for a posteriori identification of such malicious hosts to build a trust policy useful for future agent journeys. Depending on how much the agent owner trusts the hosts, he can either define an appropriate order in which selected hosts should be visited, or he can decide which hosts he does not want to contact again. Additionally, we show how the sequence of hosts to be visited should be determined in order to minimize some costs. Moreover, our proposal ensures that hosts originally intended to be visited cannot be skipped as a result of one malicious host’s misbehavior. Our method is achieved by a new protocol that combines the application of well-known cryptographic primitives and a set of rules. The proposed protocol also works in the case of colluding hosts.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Stefan Dobrev, Paola Flocchini, Guiseppe Prencipe, and Nicola Santoro. Mobile search for a black hole in an anonymous ring. In Distributed Computing (DISC 2001), 15th International Conference, Proceedings, number 2180 in LNCS. Springer Verlag, 2001.
G. Karjoth, N. Asokan, and C. GĂ¼lcĂ¼. Protecting the computation results of free-roaming agents. In Mobile Agents (MA’98), Second International Workshop, number 1477 in LNCS. Springer Verlag, 1998.
Danny B. Lange and Mitsuru Oshima. Programming and Deploying Java Mobile Agents with Aglets. Addison-Wesley, 1998.
Dong Chun Lee and Jeom Goo Kim. Adaptive migration strategy for mobile agents on internet. In Technologies for E-Services (TES 2001), Second International Workshop, Proceedings, number 2193 in LNCS. Springer Verlag, 2001.
Fred B. Schneider. Towards fault-tolerant and secure agentry. In Distributed Algorithms, 11th International Workshop (WDAG’97), Proceedings, number 1320 in LNCS. Springer Verlag, 1997.
Dirk Westhoff, Markus Schneider, Claus Unger, and Firoz Kaderali. Protecting a mobile agent’s route against collusions. In Selected Areas in Cryptography, 6th Annual International Workshop (SAC’99), number 1758 in LNCS. Springer Verlag, 2000.
Bennet S. Yee. A sanctuary for mobile agents. In J. Vitek and C.D. Jensen, editors, Secure Internet Programming, number 1603 in LNCS. Springer Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cubaleska, B., Qiu, W., Schneider, M. (2002). How to Play Sherlock Holmes in the World of Mobile Agents. In: Batten, L., Seberry, J. (eds) Information Security and Privacy. ACISP 2002. Lecture Notes in Computer Science, vol 2384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45450-0_34
Download citation
DOI: https://doi.org/10.1007/3-540-45450-0_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43861-8
Online ISBN: 978-3-540-45450-2
eBook Packages: Springer Book Archive