Recently, we challenged the belief that randomized Byzantine agreement protocols are inefficient, by designing, implementing and assessing the performance of a stack of protocols of that type . That assessment lead us to a set of properties desirable for Byzantine asynchronous binary consensus protocols: (1) Strong validity . if all correct processes propose the same value v, the decision is v (values proposed by Byzantine processes are often useless); (2) Asynchrony . no time assumptions are made (systems are often prone to arbitrary delays); (3) Decentralization . there is no leader (leader elections have a great impact on performance); (4) Optimal resilience - n ≥ 3f +1 processes to tolerate f Byzantine (extra processes are costly); (5) Optimal message complexity . O(n2) (high impact on throughput); (6) Signature freedom (high impact of signatures based on public-key cryptography on the performance); (7) Early decision . in “nice” runs the protocol should decide in a few communication steps (good latency in the “normal” case).
Work supported by project IST-4-027513-STP (CRUTIAL) and LaSIGE.
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Bracha, G.: An asynchronous \(\lfloor (n - 1)/3 \rfloor\)-resilient consensus protocol. In: PODC’84. Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pp. 154–162. ACM Press, New York (August 1984)
Castro, M., Liskov, B.: Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions Computer Systems 20(4), 398–461 (2002)
Moniz, H., Neves, N.F., Correia, M., Veríssimo, P.: Randomized intrusion-tolerant asynchronous services. In: DSN 2006. Proceedings of the International Conference on Dependable Systems and Networks. LNCS, vol. 4615, pp. 568–577 (June 2006)
Editors and Affiliations
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bessani, A.N., Correia, M., Moniz, H., Neves, N.F., Verissimo, P. (2007). When 3f + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7