Renaming in synchronous message passing systems with Byzantine failures

@article{Okun2007RenamingIS,
  title={Renaming in synchronous message passing systems with Byzantine failures},
  author={Michael Okun and Amnon Barak and Eli Gafni},
  journal={Distributed Computing},
  year={2007},
  volume={20},
  pages={403-413}
}
We study the renaming problem in a fully connected synchronous network with Byzantine failures. We show that when the original namespace of the processors is unbounded, this problem cannot be solved in an a priori bounded number of rounds for $$t\geq(n+n\textrm{ mod }3)/3$$ , where n is the size of the network and t is the number of failures. On the other hand, for n > 3t, we present a Byzantine renaming algorithm that runs in O(lg n) rounds. In addition, we present a fast, efficient strong… CONTINUE READING