Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Seven good reasons for mobile agents
Communications of the ACM
Mobile agents and the future of the internet
ACM SIGOPS Operating Systems Review
Communications of the ACM
IEEE Concurrency
FANTOMAS: Fault Tolerance for Mobile Agents in Clusters
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Towards Fault-Tolerant and Secure Agentry
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
FATOMAS-A Fault-Tolerant Mobile Agent System Based on the Agent-Dependent Approach
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
The design and implementation of a secure auction service
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Hi-index | 0.00 |
In a mobile agent based distributed system, agents must survive malicious failures of the hosts they visit, and they must be resilient to the potentially hostile actions of other hosts. The replication and voting are necessary to survive malicious behavior by visited hosts. However, faulty hosts that are not visited by agents can confound a naive replica management scheme by spoofing. This problem can be solved by cryptographic protocols. This paper describes the role of cryptographic methods in the protocols for the MARE architecture, which is a fault-tolerant mobile agent replication system. In this system, secret sharing takes on an important role in facilitating mobile processes by distributed authentication.