Paper 2020/851
Asynchronous Byzantine Agreement with Subquadratic Communication
Erica Blum, Jonathan Katz, Chen-Da Liu-Zhang, and Julian Loss
Abstract
Understanding the communication complexity of Byzantine agreement (BA) is a fundamental problem in distributed computing. In particular, as protocols are run with a large number of parties (as, e.g., in the context of blockchain protocols), it is important to understand the dependence of the communication on the number of parties
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in TCC 2020
- Keywords
- byzantine agreementsubquadratic communication
- Contact author(s)
-
erblum @ cs umd edu
jkatz2 @ gmail com
lichen @ inf ethz ch
lossjulian @ gmail com - History
- 2020-10-06: last of 2 revisions
- 2020-07-12: received
- See all versions
- Short URL
- https://ia.cr/2020/851
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/851, author = {Erica Blum and Jonathan Katz and Chen-Da Liu-Zhang and Julian Loss}, title = {Asynchronous Byzantine Agreement with Subquadratic Communication}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/851}, year = {2020}, url = {https://eprint.iacr.org/2020/851} }