Cryptology ePrint Archive: Report 2021/603

Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults

Justin Kim and Vandan Mehta and Kartik Nayak and Nibesh Shrestha

Abstract: BFT protocols in the synchronous setting rely on a strong assumption: every message sent by a party will arrive at its destination within a known bounded time. To allow some degree of asynchrony while still tolerating a minority corruption, recently, in Crypto'19, a weaker synchrony assumption called mobile sluggish faults was introduced. In this work, we investigate the support for mobile sluggish faults in existing synchronous protocols such as Dfinity, Streamlet, Sync HotStuff, OptSync and the optimal latency BFT protocol. We identify key principles that can be used to ``compile'' these synchronous protocols to tolerate mobile sluggish faults.

Category / Keywords: foundations / Distributed computing; Byzantine Fault Tolerance; Weak Synchrony

Date: received 8 May 2021, last revised 9 May 2021

Contact author: justin314kim at gmail com, vandan mehta2000 at gmail com, kartik at cs duke edu, nxs4564 at rit edu

Available format(s): PDF | BibTeX Citation

Version: 20210510:083531 (All versions of this report)

Short URL: ia.cr/2021/603


[ Cryptology ePrint archive ]