2026-07-22T21:25:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14864 2024-03-06T10:55:02Z ddc:004 open_access

Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption Yandamuri, Sravya Abraham, Ittai Nayak, Kartik Reiter, Michael communication complexity consensus trusted hardware 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sravya Yandamuri and Ittai Abraham and Kartik Nayak and Michael Reiter 2021 Is Part Of LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2021.62 urn:nbn:de:0030-drops-148647 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.62 eng https://creativecommons.org/licenses/by/4.0/legalcode