Document Open Access Logo

Reliable Broadcast Despite Mobile Byzantine Faults

Authors Silvia Bonomi , Giovanni Farina , Sébastien Tixeuil

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2023.18.pdf
  • Filesize: 1.24 MB
  • 23 pages

Document Identifiers

Author Details

Silvia Bonomi
  • Sapienza University of Rome, Italy
Giovanni Farina
  • Sapienza University of Rome, Italy
Sébastien Tixeuil
  • Sorbonne Université, CNRS, LIP6, Institut Universitaire de France, Paris, France

Funding

  • Farina, Giovanni: This work was partially supported by the CBFTFDS project - Concrete Byzantine Fault Tolerance and Forecasting in Distributed Systems (Bando di Ateneo per la Ricerca 2022, Sapienza University of Rome) and partially funded by the EURASIA project by the Italian MAECI.
  • Tixeuil, Sébastien: This work was partially funded by the ANR projects SAPPORO (ref. 2019-CE25-0005-1) and ESTATE (ref. ANR-16-CE25-0009-03).

Cite AsGet BibTex

Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Reliable Broadcast Despite Mobile Byzantine Faults. In 27th International Conference on Principles of Distributed Systems (OPODIS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 286, pp. 18:1-18:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.OPODIS.2023.18

Abstract

We investigate the solvability of the Byzantine Reliable Broadcast and Byzantine Broadcast Channel problems in distributed systems affected by Mobile Byzantine Faults. We show that both problems are not solvable even in one of the most constrained system models for mobile Byzantine faults defined so far. By endowing processes with an additional local failure oracle, we provide a solution to the Byzantine Broadcast Channel problem.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Distributed algorithms
Keywords
  • Byzantine fault-tolerance
  • Reliable Broadcast
  • Mobile Byzantine Faults

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Ittai Abraham, Ling Ren, and Zhuolun Xiang. Good-case and bad-case latency of unauthenticated byzantine broadcast: A complete categorization. In Quentin Bramas, Vincent Gramoli, and Alessia Milani, editors, 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, volume 217 of LIPIcs, pages 5:1-5:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.OPODIS.2021.5.
  2. Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. Balanced byzantine reliable broadcast with near-optimal communication and improved computation. In Alessia Milani and Philipp Woelfel, editors, PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25-29, 2022, pages 399-417. ACM, 2022. URL: https://doi.org/10.1145/3519270.3538475.
  3. Michael Backes and Christian Cachin. Reliable broadcast in a computational hybrid model with byzantine faults, crashes, and recoveries. In 2003 International Conference on Dependable Systems and Networks (DSN 2003), 22-25 June 2003, San Francisco, CA, USA, Proceedings, pages 37-46. IEEE Computer Society, 2003. URL: https://doi.org/10.1109/DSN.2003.1209914.
  4. Nazreen Banu, Samia Souissi, Taisuke Izumi, and Koichi Wada. An improved byzantine agreement algorithm for synchronous systems with mobile faults. International Journal of Computer Applications, 43(22):1-7, 2012. Google Scholar
  5. Romain Boichat and Rachid Guerraoui. Reliable and total order broadcast in the crash-recovery model. J. Parallel Distributed Comput., 65(4):397-413, 2005. URL: https://doi.org/10.1016/J.JPDC.2004.10.008.
  6. François Bonnet, Xavier Défago, Thanh Dang Nguyen, and Maria Potop-Butucaru. Tight bound on mobile byzantine agreement. Theor. Comput. Sci., 609:361-373, 2016. URL: https://doi.org/10.1016/J.TCS.2015.10.019.
  7. Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Reliable Broadcast despite Mobile Byzantine Faults, nov 2023. URL: https://hal.science/hal-04277831.
  8. Silvia Bonomi, Antonella Del Pozzo, and Maria Potop-Butucaru. Tight self-stabilizing mobile byzantine-tolerant atomic register. In Proceedings of the 17th International Conference on Distributed Computing and Networking, Singapore, January 4-7, 2016, pages 6:1-6:10. ACM, 2016. URL: https://doi.org/10.1145/2833312.2833320.
  9. Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien Tixeuil. Approximate agreement under mobile byzantine faults. In 36th IEEE International Conference on Distributed Computing Systems, ICDCS 2016, Nara, Japan, June 27-30, 2016, pages 727-728. IEEE Computer Society, 2016. URL: https://doi.org/10.1109/ICDCS.2016.68.
  10. Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien Tixeuil. Optimal mobile byzantine fault tolerant distributed storage: Extended abstract. In George Giakkoupis, editor, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 269-278. ACM, 2016. URL: https://doi.org/10.1145/2933057.2933100.
  11. Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien Tixeuil. Optimal storage under unsynchronized mobile byzantine faults. In 36th IEEE Symposium on Reliable Distributed Systems, SRDS 2017, Hong Kong, Hong Kong, September 26-29, 2017, pages 154-163. IEEE Computer Society, 2017. URL: https://doi.org/10.1109/SRDS.2017.20.
  12. Gabriel Bracha. Asynchronous byzantine agreement protocols. Inf. Comput., 75(2):130-143, 1987. URL: https://doi.org/10.1016/0890-5401(87)90054-X.
  13. Harry Buhrman, Juan A. Garay, and Jaap-Henk Hoepman. Optimal resiliency against mobile faults. In Digest of Papers: FTCS-25, The Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, California, USA, June 27-30, 1995, pages 83-88. IEEE Computer Society, 1995. URL: https://doi.org/10.1109/FTCS.1995.466995.
  14. Christian Cachin, Rachid Guerraoui, and Luís E. T. Rodrigues. Introduction to Reliable and Secure Distributed Programming (2. ed.). Springer, 2011. URL: https://doi.org/10.1007/978-3-642-15260-3.
  15. Edsger W. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, 17(11):643-644, 1974. URL: https://doi.org/10.1145/361179.361202.
  16. Shlomi Dolev. Self-Stabilization. MIT Press, 2000. URL: http://www.cs.bgu.ac.il/%7Edolev/book/book.html.
  17. Juan A. Garay. Reaching (and maintaining) agreement in the presence of mobile faults (extended abstract). In Gerard Tel and Paul M. B. Vitányi, editors, Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings, volume 857 of Lecture Notes in Computer Science, pages 253-264. Springer, 1994. URL: https://doi.org/10.1007/BFB0020438.
  18. Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, and Andrei Tonkikh. Dynamic byzantine reliable broadcast. In Quentin Bramas, Rotem Oshman, and Paolo Romano, editors, 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference), volume 184 of LIPIcs, pages 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.OPODIS.2020.23.
  19. Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi. Scalable byzantine reliable broadcast. In Jukka Suomela, editor, 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary, volume 146 of LIPIcs, pages 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.DISC.2019.22.
  20. Damien Imbs and Michel Raynal. Trading off t-resilience for efficiency in asynchronous byzantine reliable broadcast. Parallel Process. Lett., 26(4):1650017:1-1650017:8, 2016. URL: https://doi.org/10.1142/S0129626416500171.
  21. Vasilis P. Koutras and Agapios N. Platis. Chapter 3: Software rejuvenation: Key concepts and granularity. In 2020 IEEE International Symposium on Software Reliability Engineering Workshops, ISSRE Workshops, Coimbra, Portugal, October 12-15, 2020, pages 321-322. IEEE, 2020. URL: https://doi.org/10.1109/ISSREW51248.2020.00092.
  22. Jing Li, Tianming Yu, Ye Wang, and Roger Wattenhofer. Dynamic byzantine broadcast in asynchronous message-passing systems. IEEE Access, 10:91372-91384, 2022. URL: https://doi.org/10.1109/ACCESS.2022.3202627.
  23. Hung-Jen Liao, Chun-Hung Richard Lin, Ying-Chih Lin, and Kuang-Yuan Tung. Intrusion detection system: A comprehensive review. J. Netw. Comput. Appl., 36(1):16-24, 2013. URL: https://doi.org/10.1016/J.JNCA.2012.09.004.
  24. Rafail Ostrovsky and Moti Yung. How to withstand mobile virus attacks (extended abstract). In Luigi Logrippo, editor, Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 19-21, 1991, pages 51-59. ACM, 1991. URL: https://doi.org/10.1145/112600.112605.
  25. Michel Raynal. Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-94141-7.
  26. Michel Raynal. On the versatility of bracha’s byzantine reliable broadcast algorithm. Parallel Process. Lett., 31(3):2150006:1-2150006:9, 2021. URL: https://doi.org/10.1142/S0129626421500067.
  27. Rüdiger Reischuk. A new solution for the byzantine generals problem. Inf. Control., 64(1-3):23-42, 1985. URL: https://doi.org/10.1016/S0019-9958(85)80042-5.
  28. Luís E. T. Rodrigues and Michel Raynal. Atomic broadcast in asynchronous crash-recovery distributed systems. In Proceedings of the 20th International Conference on Distributed Computing Systems, Taipei, Taiwan, April 10-13, 2000, pages 288-295. IEEE Computer Society, 2000. URL: https://doi.org/10.1109/ICDCS.2000.840941.
  29. Mohamed Sabt, Mohammed Achemlal, and Abdelmadjid Bouabdallah. Trusted execution environment: What it is, and what it is not. In 2015 IEEE TrustCom/BigDataSE/ISPA, Helsinki, Finland, August 20-22, 2015, Volume 1, pages 57-64. IEEE, 2015. URL: https://doi.org/10.1109/TRUSTCOM.2015.357.
  30. Dimitris Sakavalas and Lewis Tseng. Delivery delay and mobile faults. In 17th IEEE International Symposium on Network Computing and Applications, NCA 2018, Cambridge, MA, USA, November 1-3, 2018, pages 1-8. IEEE, 2018. URL: https://doi.org/10.1109/NCA.2018.8548345.
  31. Toru Sasaki, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita. Mobile byzantine agreement on arbitrary network. In Roberto Baldoni, Nicolas Nisse, and Maarten van Steen, editors, Principles of Distributed Systems - 17th International Conference, OPODIS 2013, Nice, France, December 16-18, 2013. Proceedings, volume 8304 of Lecture Notes in Computer Science, pages 236-250. Springer, 2013. URL: https://doi.org/10.1007/978-3-319-03850-6_17.
  32. Lewis Tseng. An improved approximate consensus algorithm in the presence of mobile faults. In Paul G. Spirakis and Philippas Tsigas, editors, Stabilization, Safety, and Security of Distributed Systems - 19th International Symposium, SSS 2017, Boston, MA, USA, November 5-8, 2017, Proceedings, volume 10616 of Lecture Notes in Computer Science, pages 109-125. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-69084-1_8.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact