Secure Internet programming
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Software Deployment Using Mobile Agents
CD '02 Proceedings of the IFIP/ACM Working Conference on Component Deployment
| Hi-index | 0.00 |
In an open distributed system, agents comprising an application must not only survive (possibly malicious) failures of the hosts they visit, but they must also be resilient to the potentially hostile actions of other hosts. In particular, faulty hosts that are not visited by agents can confound a naive replica-management scheme by spoofing. Cryptographic protocols to solve this problem are summarized, as well as some experiments that show how replication can actually speed up some applications.