Cryptology ePrint Archive: Report 2021/184

Communication-Efficient BFT Protocols Using Small Trusted Hardware to Tolerate Minority Corruption

Sravya Yandamuri and Ittai Abraham and Kartik Nayak and Michael K. Reiter

Abstract: Agreement protocols for partially synchronous or asynchronous networks tolerate fewer than one-third Byzantine faults. If parties are equipped with trusted hardware that prevents equivocation, then fault tolerance can be improved to fewer than one-half Byzantine faults, but typically at the cost of increased communication complexity. In this work, we present results that use small trusted hardware without worsening communication complexity assuming the adversary controls a fraction of the network that is less than one-half. 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. Our results use expander graphs to achieve efficient communication in a manner that may be of independent interest.

Category / Keywords: foundations / consensus protocols, blockchains, trusted hardware, communication complexity

Date: received 19 Feb 2021, last revised 24 Feb 2021

Contact author: Sravya yandamuri at duke edu,kartik@cs duke edu,Michael reiter@duke edu,iabraham@vmware com

Available format(s): PDF | BibTeX Citation

Version: 20210224:175445 (All versions of this report)

Short URL: ia.cr/2021/184