Constant-space localized Byzantine consensus

Danny Dolev*, Ezra N. Hoch

*Corresponding author for this work

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

5 Scopus citations

Abstract

Adding Byzantin tolerance to large scale distributed systems is considered non-practical. The time, message and space requirements are very high. Recently, researches have investigated the broadcast problem in the presence of a f l -local Byzantin adversary. The local adversary cannot control more than fl neighbors of any given node. This paper proves sufficient conditions as to when the synchronous Byzantin consensus problem can be solved in the presence of a fl-local adversary. Moreover, we show that for a family of graphs, the Byzantin consensus problem can be solved using a relatively small number of messages, and with time complexity proportional to the diameter of the network. Specifically, for a family of bounded-degree graphs with logarithmic diameter, O(logn) time and O(n logn) messages. Furthermore, our proposed solution requires constant memory space at each node.

Original languageEnglish
Title of host publicationDistributed Computing - 22nd International Symposium, DISC 2008, Proceedings
Pages167-181
Number of pages15
DOIs
StatePublished - 2008
Event22nd International Symposium on Distributed Computing, DISC 2008 - Arcachon, France
Duration: 22 Sep 200824 Sep 2008

Publication series

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

Conference

Conference22nd International Symposium on Distributed Computing, DISC 2008
Country/TerritoryFrance
CityArcachon
Period22/09/0824/09/08

Fingerprint

Dive into the research topics of 'Constant-space localized Byzantine consensus'. Together they form a unique fingerprint.

Cite this