Fast Distributed Agreement

Toueg, Sam; Perry, Kenneth J.; Srikanth, T. K.

doi:10.1137/0216031

Cited by 57 publications

(52 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This tight bound more generally holds with respect to unconditional security, i.e., when even allowing a negligible error probability, as proven by Karlin and Yao [15]. For the same model numerous unconditionally secure protocols with optimal resilience have been proposed in the literature [9,1,19,10,3,5,13] which all have communication and computation complexities polynomial in the number of players. The extension of the standard communication model by partial broadcast was already considered by Franklin, Wright, and Yung in [11,12] in the context of secure point-to-point communication over an incomplete network -a problem initially studied by Dolev, Dwork, Waarts, and Yung [8] for the standard communication model.…”

Section: Previous Workmentioning

confidence: 85%

From partial consistency to global broadcast

Fitzi

Maurer

2000

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing

View full text Add to dashboard Cite

This paper considers unconditionally secure protocols for reliable broadcast among a set of n players, some of which may be corrupted by an active (Byzantine) adversary. In the standard model with a complete, synchronous network of pairwise authentic communication channels among the players, broadcast is achievable if and only if the number of corrupted players is less than n=3. We show that, by extending this model only by the existence of a broadcast channel among three players, global broadcast is achievable if and only if the number of corrupted players is less than n=2. Moreover, for this an even weaker primitive than broadcast among three players is sufficient. All protocols are efficient.

show abstract

Section: Previous Workmentioning

confidence: 85%

From partial consistency to global broadcast

Fitzi

Maurer

2000

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing

View full text Add to dashboard Cite

show abstract

“…That is, ByzCon's connectivity requirements, fault tolerance ratio and running time, are the same as in the Byzantine agreement algorithm of [14]; i.e., ByzCon requires a fully connected graph among the nodes participating in ByzCon and it supports up to a third of them being Byzantine.…”

Section: Fully Connected Byzantine Consensusmentioning

confidence: 97%

“…Take any Byzantine agreement 2 algorithm (for example, see [14]), and denote it by BA. ByzCon executes n instance of BA, one for each node p's input value, thus agreeing on the input value v p .…”

Section: Fully Connected Byzantine Consensusmentioning

confidence: 99%

Constant-Space Localized Byzantine Consensus

Dolev

Hoch

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Adding Byzantine 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 -local Byzantine adversary. The local adversary cannot control more than f neighbors of any given node. This paper proves sufficient conditions as to when the synchronous Byzantine consensus problem can be solved in the presence of a f -local adversary. Moreover, we show that for a family of graphs, the Byzantine 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(log n) time and O(n log n) messages. Furthermore, our proposed solution requires constant memory space at each node.

show abstract

“…A protocol with this round complexity -but with exponential message complexity -was shown in the initial work by Pease et al [24,29]. Following a long sequence of works [9,1,33,12,26,5,4], Garay and Moses [19] showed a deterministic, polynomial-time Byzantine agreement protocol having optimal resilience t < n/3 and optimal round complexity t + 1.…”

Section: Introductionmentioning

confidence: 99%

Round Complexity of Authenticated Broadcast with a Dishonest Majority

Garay¹,

Katz

Koo

et al. 2007

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)

View full text Add to dashboard Cite

Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI and secure digital signatures, where so-called authenticated broadcast is achievable for any t < n.It is known that t+1 rounds are necessary and sufficient for deterministic protocols achieving authenticated broadcast. Recently, however, randomized protocols running in expected constant rounds have been shown for the case of t < n/2. It has remained open whether randomization can improve the round complexity when an honest majority is not present. We address this question and show upper/ lower bounds on how much randomization can help:rounds. In particular, we obtain expected constant-round protocols for t = n/2 + O(1).• On the negative side, we show that even randomized protocols require Ω(2n/(n − t)) rounds. This in particular rules out expected constant-round protocols when the fraction of honest parties is sub-constant.

show abstract

Fast Distributed Agreement

Cited by 57 publications

References 7 publications

From partial consistency to global broadcast

From partial consistency to global broadcast

Constant-Space Localized Byzantine Consensus

Round Complexity of Authenticated Broadcast with a Dishonest Majority

Contact Info

Product

Resources

About