Secure Internet programming
Programming and Deploying Java Mobile Agents Aglets
Programming and Deploying Java Mobile Agents Aglets
Towards Fault-Tolerant and Secure Agentry
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Mobile Search for a Black Hole in an Anonymous Ring
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Protecting a Mobile Agent's Route against Collusions
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Adaptive Migration Strategy for Mobile Agents on Internet
TES '01 Proceedings of the Second International Workshop on Technologies for E-Services
Protecting the Computation Results of Free-Roaming Agents
MA '98 Proceedings of the Second International Workshop on Mobile Agents
| Hi-index | 0.01 |
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.