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

Conference Paper

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.

Full Text

Duke Authors

Cited Authors

  • Kim, J; Mehta, V; Nayak, K; Shrestha, N

Published Date

  • July 21, 2021

Published In

  • Proceedings of the Annual Acm Symposium on Principles of Distributed Computing

Start / End Page

  • 375 - 377

International Standard Book Number 13 (ISBN-13)

  • 9781450385480

Digital Object Identifier (DOI)

  • 10.1145/3465084.3467954

Citation Source

  • Scopus