### Byzantine Consensus under Fully Fluctuating Participation

##### Abstract

The longest-chain paradigm introduced by the Bitcoin protocol allows Byzantine consensus with fluctuating participation where nodes can spontaneously become active and inactive anytime. Since then, there have been several follow-up works that aim to achieve similar guarantees without Bitcoin's computationally expensive proof of work. However, existing solutions do not fully inherit Bitcoin's dynamic participation support. Specifically, they have to assume malicious nodes are always active, i.e., no late joining or leaving is allowed for malicious nodes, due to a problem known as costless simulation. Another problem of Bitcoin is its notoriously large latency. A series of works try to improve the latency while supporting dynamic participation. The work of Momose-Ren (CCS 2022) eventually achieved constant latency, but its concrete latency is still large. This work addresses both of these problems by presenting a protocol that has $3$ round latency, tolerates one-third malicious nodes, and allows fully dynamic participation of both honest and malicious nodes. We also present a protocol with $2$ round latency with slightly lower fault tolerance.

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
BFT Protocols Blockchain Dynamic Participation
Contact author(s)
dahliamalkhi @ gmail com
atsuki momose @ gmail com
renling @ illinois edu
History
2022-10-25: approved
See all versions
Short URL
https://ia.cr/2022/1448

CC BY

BibTeX

@misc{cryptoeprint:2022/1448,
author = {Dahlia Malkhi and Atsuki Momose and Ling Ren},
title = {Byzantine Consensus under Fully Fluctuating Participation},
howpublished = {Cryptology ePrint Archive, Paper 2022/1448},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/1448}},
url = {https://eprint.iacr.org/2022/1448}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.