Paper 2021/603 Original: eprint.iacr.org/2021/603 ↗
Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2021-05-10: last updated
- 2021-05-10: published
- Short URL
- https://ia.cr/2021/603
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/603,
author = {Justin Kim and Vandan Mehta and Kartik Nayak and Nibesh Shrestha},
title = {Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/603},
year = {2021},
url = {https://eprint.iacr.org/2021/603}
}