Brief announcement: Communication-efficient Byzantine consensus without a common clock

Danny Dolev, Christoph Lenzen

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

Abstract

Many consensus protocols assume a synchronous system in which all processes start executing the protocol at once and in the same round. However, such a common start requires to establish consensus among the correct processes in the first place, making this assumption questionable in many circumstances. In this work, we show that it is possible to consistently initiate consensus instances without a common round counter. Every correct node can initiate consistent consensus instances, without interfering with other nodes' instances. Furthermore, by bounding the frequency at which nodes may initiate instances, Byzantine faulty nodes can be prevented from initiating too many instances.

Original languageEnglish
Title of host publicationDistributed Computing - 27th International Symposium, DISC 2013, Proceedings
Pages569-570
Number of pages2
StatePublished - 2013
Event27th International Symposium on Distributed Computing, DISC 2013 - Jerusalem, Israel
Duration: 14 Oct 201318 Oct 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8205 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on Distributed Computing, DISC 2013
Country/TerritoryIsrael
CityJerusalem
Period14/10/1318/10/13

Keywords

  • Communication complexity
  • Simulation framework

Fingerprint

Dive into the research topics of 'Brief announcement: Communication-efficient Byzantine consensus without a common clock'. Together they form a unique fingerprint.

Cite this