|
|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/12944
|
| タイトル: | Tight Bound on Mobile Byzantine Agreement |
| 著者: | Bonnet, Francois
Defago, Xavier
Nguyen, Thanh Dang
Potop-Butucaru, Maria |
| キーワード: | Byzantine Agreement
Consensus
Dynamic Faults
Fault-Tolerance
Distributed Algorithms |
| 発行日: | 2014 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 8784 |
| 開始ページ: | 76 |
| 終了ページ: | 90 |
| DOI: | 10.1007/978-3-662-45174-8_6 |
| 抄録: | This paper investigates the problem of Byzantine Agreement in a synchronous system where malicious agents can move from process to process, corrupting their host. Earlier works on the problem are based on biased models which, as we argue in the paper, give an unfair advantage either to the correct processes or to the adversary controlling the malicious agents. Indeed, the earlier studies of the problem assume that, after a malicious agent has left a process, that process, said to be cured, is able to instantly and accurately detect the fact that it was corrupted in earlier rounds, and thus can take local actions to recover a valid state (Garay's model). We found no justification for that assumption which clearly favors correct processes. Under that model, an algorithm is known for n > 4t, where n is the number of processes and t the maximum number of malicious agents. The tightness of the bound is unknown. In contrast, more recent work on the problem remove the assumption on detection and assume instead that a malicious agent may have left corrupted messages in the send queue of a cured process. As a result, the adversary controlling the malicious agents can corrupt the messages sent by cured processes, as well as those sent by the newly corrupted ones, thus doubling the number of effective faults. Under that model, which favors the malicious agents, the problem can be solved if and only if n > 6t. In this paper, we refine the latter model to avoid the above biases. While a cured process may send messages (based on a state corrupted by the malicious agent), it will behave correctly in the way it sends those messages: i.e., send messages according to the algorithm. Surprisingly, in this model we could derive a new non-trivial tight bound for Byzantine Agreement. We prove that at least 5t+1 processors are needed in order to tolerate t mobile Byzantine agents and provide a time optimal algorithm that matches this lower bound, altogether with a formal specification of the problem. |
| Rights: | This is the author-created version of Springer, Francois Bonnet, Xavier Defago, Thanh Dang Nguyen, Maria Potop-Butucaru, Lecture Notes in Computer Science, 8784, 2014, 76-90. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-662-45174-8_6 |
| URI: | http://hdl.handle.net/10119/12944 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 20573.pdf | | 346Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
