You are looking at a specific version 20181207:224035 of this paper.
See the latest version.
Paper 2018/1028
Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Ittai Abraham and Srinivas Devadas and Danny Dolev and Kartik Nayak and Ling Ren
Abstract
We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of $f$ faults among $n=2f+1$ parties. Our protocols achieve an expected $O(1)$ round complexity and an expected $O(n^2)$ communication complexity. The exact round complexity in expectation is 10 for a static adversary and 16 for a strongly rushing adaptive adversary. For comparison, previous protocols in the same setting require expected 29 rounds and expected $\Omega(n^3)$ communication. We also give a lower bound showing that expected $\Omega(f^2)$ communication is necessary against a strongly rushing adaptive adversary.
Metadata
- Available format(s)
- Publication info
- Preprint. MINOR revision.
- Contact author(s)
- kartik1507 @ gmail com
- History
- 2019-03-06: last of 2 revisions
- 2018-10-26: received
- See all versions
- Short URL
- https://ia.cr/2018/1028
- License
-
CC BY