TY - GEN
T1 - Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems
AU - Georgiou, Chryssis
AU - Marcoullis, Ioannis
AU - Raynal, Michel
AU - Schiller, Elad M.
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - At PODC 2014, A. Mostéfaoui, H. Moumen, and M. Raynal presented a new and simple randomized signature-free binary consensus algorithm (denoted here as MMR) that copes with the net effect of asynchrony and Byzantine behaviors. Assuming message scheduling is fair and independent from random numbers, MMR is optimal in several respects: it deals with up to t Byzantine processes, where t< n/ 3, n being the number of processes, O(n2) messages, and O(1 ) expected time. The present article presents a non-trivial extension of MMR to an even more fault-prone context, namely, in addition to Byzantine processes, it considers also that the system can experience transient failures. To this end it considers self-stabilization techniques to cope with communication failures and arbitrary transient faults, i.e., any violation of the assumptions according to which the system was designed to operate. The proposed algorithm is the first loosely-self-stabilizing Byzantine fault-tolerant binary consensus algorithm suited to asynchronous message-passing systems. This is achieved via an instructive transformation of MMR to a loosely-self-stabilizing solution that can violate safety requirements with probability Pr = O(1 / (2 M) ), where M is a predefined constant that can be set to any positive integer at the cost of 3 Mn+ log M bits of local memory. In addition to making MMR resilient to transient faults, the obtained loosely-self-stabilizing algorithm preserves its properties of optimal resilience and termination, i.e., t< n/ 3 and O(1 ) expected time. Furthermore, it only requires a bounded amount of memory.
AB - At PODC 2014, A. Mostéfaoui, H. Moumen, and M. Raynal presented a new and simple randomized signature-free binary consensus algorithm (denoted here as MMR) that copes with the net effect of asynchrony and Byzantine behaviors. Assuming message scheduling is fair and independent from random numbers, MMR is optimal in several respects: it deals with up to t Byzantine processes, where t< n/ 3, n being the number of processes, O(n2) messages, and O(1 ) expected time. The present article presents a non-trivial extension of MMR to an even more fault-prone context, namely, in addition to Byzantine processes, it considers also that the system can experience transient failures. To this end it considers self-stabilization techniques to cope with communication failures and arbitrary transient faults, i.e., any violation of the assumptions according to which the system was designed to operate. The proposed algorithm is the first loosely-self-stabilizing Byzantine fault-tolerant binary consensus algorithm suited to asynchronous message-passing systems. This is achieved via an instructive transformation of MMR to a loosely-self-stabilizing solution that can violate safety requirements with probability Pr = O(1 / (2 M) ), where M is a predefined constant that can be set to any positive integer at the cost of 3 Mn+ log M bits of local memory. In addition to making MMR resilient to transient faults, the obtained loosely-self-stabilizing algorithm preserves its properties of optimal resilience and termination, i.e., t< n/ 3 and O(1 ) expected time. Furthermore, it only requires a bounded amount of memory.
KW - Binary consensus
KW - Byzantine fault-tolerance
KW - Self-stabilization
UR - http://www.scopus.com/inward/record.url?scp=85121878599&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-91014-3_3
DO - 10.1007/978-3-030-91014-3_3
M3 - Conference contribution
AN - SCOPUS:85121878599
SN - 9783030910136
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 36
EP - 53
BT - Networked Systems - 9th International Conference, NETYS 2021, Proceedings
A2 - Echihabi, Karima
A2 - Meyer, Roland
PB - Springer Science and Business Media Deutschland GmbH
T2 - 9th International Conference on Networked Systems, NETYS 2021
Y2 - 19 May 2021 through 21 May 2021
ER -