Searching for a black hole in arbitrary networks: optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Classification of malicious host threats in mobile agent computing
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Software—Practice & Experience - Special issue: Mobile agent systems
Watermarking, tamper-proffing, and obfuscation: tools for software protection
IEEE Transactions on Software Engineering
ACM Transactions on Internet Technology (TOIT)
Mobile Search for a Black Hole in an Anonymous Ring
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A secure modular mobile agent system
Proceedings of the 2006 international workshop on Software engineering for large-scale multi-agent systems
MAWS: A platform-independent framework for mobile agents using Web services
Journal of Parallel and Distributed Computing
Adaption in distributed systems: an evolutionary approach
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Complexity of Searching for a Black Hole
Fundamenta Informaticae
A security protocol for mobile agents based upon the cooperation of sedentary agents
Journal of Network and Computer Applications
Mobile Information Systems
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
SMASH: Modular Security for Mobile Agents
Software Engineering for Multi-Agent Systems V
Locating and Repairing Faults in a Network with Mobile Agents
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
A Mechanism to Avoid Collusion Attacks Based on Code Passing in Mobile Agent Systems
WISTP '09 Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
An improved execution integrity solution for mobile agents
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Searching for a black hole in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Hardness and approximation results for black hole search in arbitrary graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
A secure protocol for mobile agents in hostile environment
MATA'05 Proceedings of the Second international conference on Mobility Aware Technologies and Applications
Approximation bounds for black hole search problems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Periodic data retrieval problem in rings containing a malicious host
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Complexity of Searching for a Black Hole
Fundamenta Informaticae
| Hi-index | 0.00 |
To protect mobile agents from attacks by their execution environments, or hosts, one class of protection mechanisms uses reference states to detect modification attacks. Reference states are agent states that have been produced by non-attacking, or reference hosts.This paper examines this class of mechanisms and presents the bandwidth of the achieved protection. First, the notion of reference states is introduced. This notion allows to define a protection scheme that can be used to realize a whole class of mechanisms to protect mobile agents. To do so, after an initial analysis of already existing approaches, the abstract features of these approaches are extracted. A discussion examines the strengths and weaknesses of the general protection scheme, and a framework is presented that allows an agent programmer to choose an appropriate protection level using this scheme. An example illustrates the usage of the framework and its overhead.