A new solution for the byzantine generals problem
Information and Control
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Asymptotically Optimal Distributed Consensus (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Maintaining Security in the Presence of Transient Faults
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
Abstract: We consider a model where malicious agents can corrupt hosts and move around in a network of processors. We consider a family of mobile fault models MF(t/n-1,/spl rho/). In MF(t/n-1,/spl rho/) there are a total of n processors, the maximum number of mobile faults is t, and their roaming pace is /spl rho/ (for example, /spl rho/=3 means that it takes an agent at least 3 rounds to "hop" to the next host). We study in these models the classical testbed problem for fault tolerant distributed computing: Byzantine agreement. It has been shown that if /spl rho/=1, then agreement cannot be reached in the presence of even one fault, unless one of the processors remains uncorrupted for a certain amount of time. Subject to this proviso, we present a protocol for MF(/sup 1///sub 3/,1), which is optimal. The running time of the protocol is O(n) rounds, also optimal for these models.