Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults
Publication
, Conference
Kim, J; Mehta, V; Nayak, K; Shrestha, N
Published in: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
July 21, 2021
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.
Duke Scholars
Published In
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
DOI
Publication Date
July 21, 2021
Start / End Page
375 / 377
Citation
APA
Chicago
ICMJE
MLA
NLM
Kim, J., Mehta, V., Nayak, K., & Shrestha, N. (2021). Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 375–377). https://doi.org/10.1145/3465084.3467954
Kim, J., V. Mehta, K. Nayak, and N. Shrestha. “Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults.” In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 375–77, 2021. https://doi.org/10.1145/3465084.3467954.
Kim J, Mehta V, Nayak K, Shrestha N. Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2021. p. 375–7.
Kim, J., et al. “Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 2021, pp. 375–77. Scopus, doi:10.1145/3465084.3467954.
Kim J, Mehta V, Nayak K, Shrestha N. Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2021. p. 375–377.
Published In
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
DOI
Publication Date
July 21, 2021
Start / End Page
375 / 377