@inproceedings{37e432841dfe454bad551dd4daf0f814,
title = "Renaming in message passing systems with Byzantine failures",
abstract = "We study the renaming problem in a fully connected synchronous network with Byzantine failures. We show that when faulty processors are able to cheat about their original identities, this problem cannot be solved in an a priori bounded number of rounds for t ≥ (n + n mod 3)/3, where n is the size of the network and t is the number of failures. This result also implies a t ≥ (n + n mod 4)/2 bound for the case of faulty processors that are not able to falsify their original identities. In addition, we present several Byzantine renaming algorithms based on distinct approaches, each providing a different tradeoff between its running time and the solution quality.",
author = "Michael Okun and Amnon Barak",
year = "2006",
doi = "10.1007/11864219_2",
language = "אנגלית",
isbn = "3540446249",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "16--30",
booktitle = "Distributed Computing - 20th International Symposium, DISC 2006, Proceedings",
address = "גרמניה",
note = "20th International Symposium on Distributed Computing, DISC 2006 ; Conference date: 18-09-2006 Through 20-09-2006",
}