Abstract
This paper introduces a new reliable broadcast communication abstraction suited to n-process asynchronous message-passing systems in which up to t processes may behave arbitrarily (Byzantine processes) and where (due to transient disconnections or message losses) up to d correct processes may not receive a message broadcast by a correct (i.e., not Byzantine) process. Then the paper presents and proves correct an algorithm implementing such a communication abstraction where the system parameters n, t, and d are such that \(n>3t +2d\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
The term delivery refers here to the application layer where a process receives and can access the content of an application message. See Sect. 3.
- 2.
Let us observe that, as at the implementation level the message adversary can always suppress all the implementation messages send to a fixed set D of d processes, these SCB-delivery properties are the best that can be done.
References
Afek, Y., Gafni, E.: Asynchrony from synchrony. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 225–239. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35668-1_16
Bracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75(2), 130–143 (1987)
Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824–840 (1985)
Cachin, Ch., Guerraoui, R., Rodrigues, L.: Reliable and Secure Distributed Programming, p. 367. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-15260-3. ISBN 978-3-642-15259-7
Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distrib. Comput. 22(1), 49–71 (2009). https://doi.org/10.1007/s00446-009-0084-6
Guerraoui, G., Komatovic, J., Kuznetsov, P., Pignolet, P.A., Seredinschi, D.-A., Tonkikh A.: Dynamic Byzantine reliable broadcast. In: Proceedings of 24th International Conference on Principles of Distributed Systems (OPODIS’20), LIPIcs, vol. 184, Article 23, 18 p. (2020)
Guerraoui, G., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.-A.: Scalable Byzantine reliable broadcast. In: Proceedings of 33rd International Symposium on Distributed Computing (DISC’19), LIPIcs, vol. 146, Article 22, 16 p. (2019)
Hirt, M., Kastrato, A., Liu-Zhang, C.-D.: Multi-threshold asynchronous reliable broadcast and consensus. In: Proceedings of 24th International Conference on Principles of Distributed Systems (OPODIS’20), LIPICs, vol. 184, Article 6, 16 p. (2020)
Imbs, D., Raynal, M.: Trading \(t\)-resilience for efficiency in asynchronous Byzantine reliable broadcast. Parallel Process. Lett. 26(4), 8 (2016)
Lamport, L., Shostack, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for Byzantine broadcast and agreement. In: Proceedings of 34rd Int’l Symposium on Distributed Computing (DISC’20), LIPIcs, vol. 179, Article 28, 16 p. (2020)
Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228–234 (1980)
Raynal, M.: Message adversaries. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1272–1276. Springer, Heidelberg (2015). https://doi.org/10.1007/978-1-4939-2864-4
Raynal, M.: Fault-Tolerant Message-passing Distributed Systems: An Algorithmic Approach, p. 480. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-319-94141-7. ISBN 978-3-319-94140-0
Raynal, M.: On the versatility of Bracha’s Byzantine reliable broadcast algorithm. Parallel Process. Lett. 31(3), 2150006 (2021)
Raynal, M., Stainer, J.: Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. In: Proceedings of 32nd ACM Symposium on Principles of Distributed Computing (PODC ’13), pp. 166–175. ACM Press (2013)
Santoro, N., Widmayer, P.: Time is not a healer. In: Monien, B., Cori, R. (eds.) STACS 1989. LNCS, vol. 349, pp. 304–313. Springer, Heidelberg (1989). https://doi.org/10.1007/BFb0028994
Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. Theoret. Comput. Sci. 384(2–3), 232–249 (2007)
Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2, 80–94 (1987). https://doi.org/10.1007/BF01667080
Acknowledgments
This work was partially supported by the French ANR project ByBLoS (ANR-20-CE25-0002-01) devoted to the modular design of building blocks for large-scale Byzantine-tolerant multi-users applications. The authors want to thank Colette Johnen, Elad Schiller, and Stefan Schmid for their kind invitation to participate in the conference.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Albouy, T., Frey, D., Raynal, M., Taïani, F. (2021). Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn. In: Johnen, C., Schiller, E.M., Schmid, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2021. Lecture Notes in Computer Science(), vol 13046. Springer, Cham. https://doi.org/10.1007/978-3-030-91081-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-91081-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91080-8
Online ISBN: 978-3-030-91081-5
eBook Packages: Computer ScienceComputer Science (R0)