Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement

by   Manish Kumar, et al.

This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called implicit Byzantine agreement problem where each node starts with an input value and at the end a non-empty subset of the honest nodes should agree on a common input value by satisfying the BA properties (i.e., there can be undecided nodes). We show that a sublinear (in n, number of nodes) message complexity BA protocol under honest majority is possible in the standard PKI model when the nodes have access to an unbiased global coin and hash function. In particular, we present a randomized Byzantine agreement algorithm which, with high probability achieves implicit agreement, uses Õ(√(n)) messages, and runs in Õ(1) rounds while tolerating (1/2 - ϵ)n Byzantine nodes for any fixed ϵ > 0, the notation O hides a O(n) factor. The algorithm requires standard cryptographic setup PKI and hash function with a static Byzantine adversary. The algorithm works in the CONGEST model and each node does not need to know the identity of its neighbors, i.e., works in the KT_0 model. The message complexity (and also the time complexity) of our algorithm is optimal up to a n factor, as we show a Ω(√(n)) lower bound on the message complexity.


page 1

page 2

page 3

page 4


Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols

Motivated, in part, by the rise of permissionless systems such as Bitcoi...

Asynchronous Byzantine Agreement in Incomplete Networks [Technical Report]

The Byzantine agreement problem is considered to be a core problem in di...

Fundamental Limits of Byzantine Agreement

Byzantine agreement (BA) is a distributed consensus problem where n proc...

Byzantine-Resilient Counting in Networks

We present two distributed algorithms for the Byzantine counting problem...

Byzantine Preferential Voting

In the Byzantine agreement problem, n nodes with possibly different inpu...

DORA: Distributed Oracle Agreement with Simple Majority

Oracle networks feeding off-chain information to a blockchain are requir...

Complexity of the quorum intersection property of the Federated Byzantine Agreement System

A Federated Byzantine Agreement System is defined as a pair (V, Q) compr...

Please sign up or login with your details

Forgot password? Click here to reset