On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Agreement among unacquainted byzantine generals
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 5.23 |
We consider here the Byzantine agreement problem in synchronous systems with homonyms. In this model different processes may have the same authenticated identifier. In such a system of n processes sharing a set of l identifiers, we define a distribution of the identifiers as an integer partition of n into l parts n"1,...,n"l giving for each identifier i the number of processes having this identifier. Assuming that the processes know the distribution of identifiers we give a necessary and sufficient condition on the integer partition of n to solve the Byzantine agreement with at most t Byzantine processes. Moreover we prove that there exists a distribution of l identifiers enabling to solve Byzantine agreement with at most t Byzantine processes if and only if n3t, lt and l(n-r)tn-t-min(t,r) where r=nmodl. This bound is to be compared with the l3t bound proved in Delporte-Gallet et al. (2011) [4] when the processes do not know the distribution of identifiers.