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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageAmerican English
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
EditorsTaisuke Izumi, Petr Kuznetsov
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783030032319
StatePublished - 1 Jan 2018
Event20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 - Tokyo, Japan
Duration: 4 Nov 20187 Nov 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11201 LNCS


Conference20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018


  • Byzantine failures
  • Consensus
  • Detection
  • Distributed algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Bee’s strategy against byzantines replacing byzantine participants: (Extended Abstract)'. Together they form a unique fingerprint.

Cite this