License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2021.62
URN: urn:nbn:de:0030-drops-148647
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14864/
Yandamuri, Sravya ;
Abraham, Ittai ;
Nayak, Kartik ;
Reiter, Michael
Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption
Abstract
Small trusted hardware primitives can improve fault tolerance of Byzantine Fault Tolerant (BFT) protocols to one-half faults. However, existing works achieve this at the cost of increased communication complexity. In this work, we explore the design of communication-efficient BFT protocols that can boost fault tolerance to one-half without worsening communication complexity. Our results include a version of HotStuff that retains linear communication complexity in each view and a version of the VABA protocol with quadratic communication, both leveraging trusted hardware to tolerate a minority of corruptions. As a building block, we present communication-efficient provable broadcast, a core broadcast primitive with increased fault tolerance. Our results use expander graphs to achieve efficient communication in a manner that may be of independent interest.
BibTeX - Entry
@InProceedings{yandamuri_et_al:LIPIcs.DISC.2021.62,
author = {Yandamuri, Sravya and Abraham, Ittai and Nayak, Kartik and Reiter, Michael},
title = {{Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {62:1--62:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14864},
URN = {urn:nbn:de:0030-drops-148647},
doi = {10.4230/LIPIcs.DISC.2021.62},
annote = {Keywords: communication complexity, consensus, trusted hardware}
}
Keywords: |
|
communication complexity, consensus, trusted hardware |
Collection: |
|
35th International Symposium on Distributed Computing (DISC 2021) |
Issue Date: |
|
2021 |
Date of publication: |
|
04.10.2021 |