Skip to main content
Springer Nature Link
Log in

Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults

  • Conference paper
  • First Online:
Networked Systems (NETYS 2020)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 12129))

Included in the following conference series:

  • 456 Accesses

Abstract

Every non-trivial distributed application needs to exchange information in order accomplish its task, and reliable communication primitives are fundamental in failures prone distributed systems to guarantee correct message exchanges between parties.

Their implementation becomes particularly challenging when considering distributed systems where processes are arranged in a multi-hop network and each of them may temporary and continuously be compromised by an attacker during the execution. Although some fundamental problems (such as the register implementation and the agreement) were investigated considering Mobile Byzantine Faults (MBF), most of the contributions consider a fully connected communication network.

In this paper we analyze the specific difficulty of ensuring reliable communication between parties in a distributed system affected by Mobile Byzantine Faults (compared to the case where the Byzantine failures are static), showing that such a problem is essentially impossible to solve in asynchronous systems with MBF, and we propose a synchronous protocol providing reliable communication both in complete networks and specific multi-hop topologies.

This work was performed within Project ESTATE (Ref. ANR-16-CE25-0009-03), supported by French state funds managed by the ANR (Agence Nationale de la Recherche) and it has been partially supported by the INOCS Sapienza Ateneo 2017 Project (protocol number RM11715C816CE4CB). Giovanni Farina wishes to thank Université Franco-Italienne/Universitá Italo-Francese (UFI/UIF) for supporting his mobility through the Vinci grant 2018.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    \(\varGamma (s)\) is the set of nodes in the neighborhood of node s in a graph.

References

  1. Bonnet, F., Défago, X., Nguyen, T.D., Potop-Butucaru, M.: Tight bound on mobile Byzantine agreement. Theoret. Comput. Sci. 609, 361–373 (2016). https://doi.org/10.1016/j.tcs.2015.10.019

    Article  MathSciNet  MATH  Google Scholar 

  2. Bonomi, S., Farina, G., Tixeuil, S.: Reliable broadcast in dynamic networks with locally bounded Byzantine failures. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 170–185. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03232-6_12

    Chapter  Google Scholar 

  3. Bonomi, S., Farina, G., Tixeuil, S.: Multi-hop Byzantine reliable broadcast with honest dealer made practical. J. Braz. Comput. Soc. 25(1), 9:1–9:23 (2019). https://doi.org/10.1186/s13173-019-0090-x

    Article  Google Scholar 

  4. Bonomi, S., Pozzo, A.D., Potop-Butucaru, M.: Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register. Theoret. Comput. Sci. 709, 64–79 (2018). https://doi.org/10.1016/j.tcs.2017.08.020

    Article  MathSciNet  MATH  Google Scholar 

  5. Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Optimal storage under unsynchronized mobile Byzantine faults. In: 36th IEEE Symposium on Reliable Distributed Systems, SRDS 2017, Hong Kong, 26–29 September 2017, pp. 154–163. IEEE Computer Society (2017). https://doi.org/10.1109/SRDS.2017.20

  6. Bonomi, S., Del Pozzo, A., Potop-Butucaru, M., Tixeuil, S.: Brief announcement: optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 398–403. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03232-6_28

    Chapter  MATH  Google Scholar 

  7. Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Approximate agreement under mobile Byzantine faults. Theoret. Comput. Sci. 758, 17–29 (2019). https://doi.org/10.1016/j.tcs.2018.08.001

    Article  MathSciNet  MATH  Google Scholar 

  8. Buhrman, H., Garay, J.A., Hoepman, J.: Optimal resiliency against mobile faults. In: Digest of Papers: FTCS-25, The Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, California, USA, 27–30 June 1995, pp. 83–88. IEEE Computer Society (1995). https://doi.org/10.1109/FTCS.1995.466995

  9. Cachin, C., Guerraoui, R., Rodrigues, L.E.T.: Introduction to Reliable and Secure Distributed Programming, 2nd edn. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-15260-3

    Book  MATH  Google Scholar 

  10. Dolev, D.: Unanimity in an unknown and unreliable environment. In: 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, USA, 28–30 October 1981, pp. 159–168 (1981). https://doi.org/10.1109/SFCS.1981.53

  11. Garay, J.A.: Reaching (and maintaining) agreement in the presence of mobile faults (extended abstract). In: Tel, G., Vitányi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 253–264. Springer, Heidelberg (1994). https://doi.org/10.1007/BFb0020438

    Chapter  Google Scholar 

  12. Litsas, C., Pagourtzis, A., Sakavalas, D.: A graph parameter that matches the resilience of the certified propagation algorithm. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds.) ADHOC-NOW 2013. LNCS, vol. 7960, pp. 269–280. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39247-4_23

    Chapter  Google Scholar 

  13. Maurer, A., Tixeuil, S.: Byzantine broadcast with fixed disjoint paths. J. Parallel Distrib. Comput. 74(11), 3153–3160 (2014). https://doi.org/10.1016/j.jpdc.2014.07.010

    Article  Google Scholar 

  14. Maurer, A., Tixeuil, S.: Self-stabilizing Byzantine broadcast. In: 33rd IEEE International Symposium on Reliable Distributed Systems, SRDS 2014, Nara, Japan, 6–9 October 2014, pp. 152–160. IEEE Computer Society (2014). https://doi.org/10.1109/SRDS.2014.10

  15. Maurer, A., Tixeuil, S.: Containing Byzantine failures with control zones. IEEE Trans. Parallel Distrib. Syst. 26(2), 362–370 (2015). https://doi.org/10.1109/TPDS.2014.2308190

    Article  Google Scholar 

  16. Maurer, A., Tixeuil, S.: Tolerating random Byzantine failures in an unbounded network. Parallel Process. Lett. 26(1), 1650003:1–1650003:12 (2016). https://doi.org/10.1142/S0129626416500031

    Article  MathSciNet  MATH  Google Scholar 

  17. Maurer, A., Tixeuil, S., Défago, X.: Communicating reliably in multihop dynamic networks despite Byzantine failures. In: 34th IEEE Symposium on Reliable Distributed Systems, SRDS 2015, Montreal, QC, Canada, 28 September–1 October 2015, pp. 238–245. IEEE Computer Society (2015). https://doi.org/10.1109/SRDS.2015.10

  18. Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Logrippo, L. (ed.) Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, 19–21 August 1991, pp. 51–59. ACM (1991). https://doi.org/10.1145/112600.112605

  19. Pagourtzis, A., Panagiotakos, G., Sakavalas, D.: Reliable broadcast with respect to topology knowledge. Distrib. Comput. 30(2), 87–102 (2017). https://doi.org/10.1007/s00446-016-0279-6

    Article  MathSciNet  MATH  Google Scholar 

  20. Pelc, A.: Reliable communication in networks with Byzantine link failures. Networks 22(5), 441–459 (1992). https://doi.org/10.1002/net.3230220503

    Article  MATH  Google Scholar 

  21. Pelc, A., Peleg, D.: Broadcasting with locally bounded Byzantine faults. Inf. Process. Lett. 93(3), 109–115 (2005). https://doi.org/10.1016/j.ipl.2004.10.007

    Article  MathSciNet  MATH  Google Scholar 

  22. Reischuk, R.: A new solution for the Byzantine generals problem. Inf. Control 64(1–3), 23–42 (1985). https://doi.org/10.1016/S0019-9958(85)80042-5

    Article  MathSciNet  MATH  Google Scholar 

  23. Sakavalas, D., Tseng, L.: Delivery delay and mobile faults. In: 17th IEEE International Symposium on Network Computing and Applications, NCA 2018, Cambridge, MA, USA, 1–3 November 2018, pp. 1–8. IEEE (2018). https://doi.org/10.1109/NCA.2018.8548345

  24. Sasaki, T., Yamauchi, Y., Kijima, S., Yamashita, M.: Mobile Byzantine agreement on arbitrary network. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol. 8304, pp. 236–250. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03850-6_17

    Chapter  Google Scholar 

  25. Tseng, L., Vaidya, N.H., Bhandari, V.: Broadcast using certified propagation algorithm in presence of Byzantine faults. Inf. Process. Lett. 115(4), 512–514 (2015). https://doi.org/10.1016/j.ipl.2014.11.010

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sapienza Università di Roma, Rome, Italy

    Silvia Bonomi & Giovanni Farina

  2. Sorbonne Université, CNRS, LIP6, 75005, Paris, France

    Giovanni Farina & Sébastien Tixeuil

Authors
  1. Silvia Bonomi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giovanni Farina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sébastien Tixeuil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giovanni Farina .

Editor information

Editors and Affiliations

  1. University of Cyprus, Nicosia, Cyprus

    Chryssis Georgiou

  2. Max Planck Institute for Software Systems, Kaiserslautern, Germany

    Rupak Majumdar

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bonomi, S., Farina, G., Tixeuil, S. (2021). Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults. In: Georgiou, C., Majumdar, R. (eds) Networked Systems. NETYS 2020. Lecture Notes in Computer Science(), vol 12129. Springer, Cham. https://doi.org/10.1007/978-3-030-67087-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67087-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67086-3

  • Online ISBN: 978-3-030-67087-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation