TY - GEN
T1 - Bee’s strategy against byzantines replacing byzantine participants
T2 - 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018
AU - Shaer, Amitay
AU - Dolev, Shlomi
AU - Bonomi, Silvia
AU - Raynal, Michel
AU - Baldoni, Roberto
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2018.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - Schemes for the identification and replacement of two-faced Byzantine processes are presented. The detection is based on the comparison of the (blackbox) decision result of a Byzantine consensus on input consisting of the inputs of each of the processes, in a system containing n processes p1, …, pn. Process pi that received a gossiped message from pj with the input of another process pk, that differs from pk ’s input value as received from pk by pi, reports on pk and pj being two-faced. If enough processes (where enough means at least t+1, t < n, is a threshold on the number of Byzantine participants) report on the same participant pj to be two-faced, participant pj is replaced. If less than the required t+1 processes threshold report on a participant pj, both the reporting processes and the reported process are replaced. If one of them is not Byzantine, its replacement is the price to pay to cope with the uncertainty created by Byzantine processes. The scheme ensures that any two-faced Byzantine participant that prevents fast termination is eliminated and replaced. Such replacement may serve as a preparation for the next invocations of Byzantine agreement possibly used to implement a replicated state machine.
AB - Schemes for the identification and replacement of two-faced Byzantine processes are presented. The detection is based on the comparison of the (blackbox) decision result of a Byzantine consensus on input consisting of the inputs of each of the processes, in a system containing n processes p1, …, pn. Process pi that received a gossiped message from pj with the input of another process pk, that differs from pk ’s input value as received from pk by pi, reports on pk and pj being two-faced. If enough processes (where enough means at least t+1, t < n, is a threshold on the number of Byzantine participants) report on the same participant pj to be two-faced, participant pj is replaced. If less than the required t+1 processes threshold report on a participant pj, both the reporting processes and the reported process are replaced. If one of them is not Byzantine, its replacement is the price to pay to cope with the uncertainty created by Byzantine processes. The scheme ensures that any two-faced Byzantine participant that prevents fast termination is eliminated and replaced. Such replacement may serve as a preparation for the next invocations of Byzantine agreement possibly used to implement a replicated state machine.
KW - Byzantine failures
KW - Consensus
KW - Detection
KW - Distributed algorithms
UR - https://www.scopus.com/pages/publications/85056473524
U2 - 10.1007/978-3-030-03232-6_10
DO - 10.1007/978-3-030-03232-6_10
M3 - Conference contribution
AN - SCOPUS:85056473524
SN - 9783030032319
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 139
EP - 153
BT - Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
A2 - Izumi, Taisuke
A2 - Kuznetsov, Petr
PB - Springer Verlag
Y2 - 4 November 2018 through 7 November 2018
ER -