1 research outputs found
On the Number of Synchronous Rounds Required for Byzantine Agreement
Byzantine agreement is typically considered with respect to either a
fully synchronous network or a fully asynchronous one. In the
synchronous case, either deterministic rounds are necessary in
order to achieve Byzantine agreement or at least some expected large
constant number of rounds.
In this paper we examine the question of how many initial synchronous
rounds are required for Byzantine agreement if we allow to switch to
asynchronous operation afterwards.
Let be the number of parties where are honest and are
corrupted. As the main result we show that, in the model with a
public-key infrastructure and signatures, deterministic
synchronous rounds are sufficient where is the minimal integer
such that . This improves over the necessary
deterministic rounds for almost all cases, and over the exact
expected number of rounds in the non-deterministic case for many
cases