Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract)

Amitay Shaer; Shlomi Dolev; Silvia Bonomi; Michel Raynal; Roberto Baldoni

doi:10.1007/978-3-030-03232-6_10

Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract)

Amitay Shaer, Shlomi Dolev, Silvia Bonomi, Michel Raynal, Roberto Baldoni

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 p₁, …, p_n. Process p_i that received a gossiped message from p_j with the input of another process p_k, that differs from p_k ’s input value as received from p_k by p_i, reports on p_k and p_j 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 p_j to be two-faced, participant p_j is replaced. If less than the required t+1 processes threshold report on a participant p_j, 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.

Original language	American English
Title of host publication	Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
Editors	Taisuke Izumi, Petr Kuznetsov
Publisher	Springer Verlag
Pages	139-153
Number of pages	15
ISBN (Print)	9783030032319
DOIs	https://doi.org/10.1007/978-3-030-03232-6_10
State	Published - 1 Jan 2018
Event	20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 - Tokyo, Japan Duration: 4 Nov 2018 → 7 Nov 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11201 LNCS

Conference

Conference	20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018
Country/Territory	Japan
City	Tokyo
Period	4/11/18 → 7/11/18

Keywords

Byzantine failures
Consensus
Detection
Distributed algorithms

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-03232-6_10

Cite this

Shaer, A., Dolev, S., Bonomi, S., Raynal, M., & Baldoni, R. (2018). Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract). In T. Izumi, & P. Kuznetsov (Eds.), Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings (pp. 139-153). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11201 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03232-6_10

Shaer, Amitay ; Dolev, Shlomi ; Bonomi, Silvia et al. / Bee’s strategy against byzantines replacing byzantine participants : (Extended Abstract). Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. editor / Taisuke Izumi ; Petr Kuznetsov. Springer Verlag, 2018. pp. 139-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7fc35ee7a1024b8c848a150e57d184d2,

title = "Bee{\textquoteright}s strategy against byzantines replacing byzantine participants: (Extended Abstract)",

abstract = "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 {\textquoteright}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.",

keywords = "Byzantine failures, Consensus, Detection, Distributed algorithms",

author = "Amitay Shaer and Shlomi Dolev and Silvia Bonomi and Michel Raynal and Roberto Baldoni",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 ; Conference date: 04-11-2018 Through 07-11-2018",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-030-03232-6_10",

language = "American English",

isbn = "9783030032319",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "139--153",

editor = "Taisuke Izumi and Petr Kuznetsov",

booktitle = "Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings",

address = "Germany",

}

Shaer, A, Dolev, S, Bonomi, S, Raynal, M & Baldoni, R 2018, Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract). in T Izumi & P Kuznetsov (eds), Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11201 LNCS, Springer Verlag, pp. 139-153, 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018, Tokyo, Japan, 4/11/18. https://doi.org/10.1007/978-3-030-03232-6_10

Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract). / Shaer, Amitay; Dolev, Shlomi; Bonomi, Silvia et al.
Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. ed. / Taisuke Izumi; Petr Kuznetsov. Springer Verlag, 2018. p. 139-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11201 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

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 - http://www.scopus.com/inward/record.url?scp=85056473524&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-03232-6_10

DO - 10.1007/978-3-030-03232-6_10

M3 - Conference contribution

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 -

Shaer A, Dolev S, Bonomi S, Raynal M, Baldoni R. Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract). In Izumi T, Kuznetsov P, editors, Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. Springer Verlag. 2018. p. 139-153. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-03232-6_10

Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract)

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this