{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T06:05:01Z","timestamp":1779602701167,"version":"3.53.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032264640","type":"print"},{"value":"9783032264657","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-26465-7_7","type":"book-chapter","created":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:51:40Z","timestamp":1779601900000},"page":"112-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Solvability of\u00a0Byzantine-Tolerant Reliable Communication in\u00a0Dynamic Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9928-5357","authenticated-orcid":false,"given":"Silvia","family":"Bonomi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4792-5305","authenticated-orcid":false,"given":"Giovanni","family":"Farina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0948-7172","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Bonomi, S., Decouchant, J., Farina, G., Rahli, V., Tixeuil, S.: Practical byzantine reliable broadcast on partially connected networks. In: 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, July 7\u201310, 2021. pp. 506\u2013516. IEEE (2021). https:\/\/doi.org\/10.1109\/ICDCS51616.2021.00055","DOI":"10.1109\/ICDCS51616.2021.00055"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-030-03232-6_12","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Bonomi","year":"2018","unstructured":"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\u2013185. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_12"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Bonomi, S., Farina, G., Tixeuil, S.: Multi-hop byzantine reliable broadcast with honest dealer made practical. J. Braz. Comput. Soc. 25(1), 9:1\u20139:23 (2019). https:\/\/doi.org\/10.1186\/s13173-019-0090-x","DOI":"10.1186\/s13173-019-0090-x"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bonomi, S., Farina, G., Tixeuil, S.: Reliable broadcast despite mobile byzantine faults. In: Bessani, A., D\u00e9fago, X., Nakamura, J., Wada, K., Yamauchi, Y. (eds.) 27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6\u20138, 2023, Tokyo, Japan. LIPIcs, vol.\u00a0286, pp. 18:1\u201318:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.OPODIS.2023.18","DOI":"10.4230\/LIPICS.OPODIS.2023.18"},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2024.104952","volume":"193","author":"S Bonomi","year":"2024","unstructured":"Bonomi, S., Farina, G., Tixeuil, S.: Reliable communication in dynamic networks with locally bounded byzantine faults. J. Parallel Distrib. Comput. 193, 104952 (2024). https:\/\/doi.org\/10.1016\/j.jpdc.2024.104952","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR6","unstructured":"Bonomi, S., Farina, G., Tixeuil, S.: On the solvability of byzantine-tolerant reliable communication in dynamic networks (2025). https:\/\/arxiv.org\/abs\/2503.22452"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Cachin, C., Guerraoui, R., Rodrigues, L.E.T.: Introduction to Reliable and Secure Distributed Programming (2. ed.). Springer, Cham (2011). https:\/\/doi.org\/10.1007\/978-3-642-15260-3","DOI":"10.1007\/978-3-642-15260-3"},{"key":"7_CR8","unstructured":"Casteigts, A.: A Journey through Dynamic Networks (with Excursions) (2018). https:\/\/tel.archives-ouvertes.fr\/tel-01883384"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emerg. Distrib. Syst. 27(5), 387\u2013408 (2012). https:\/\/doi.org\/10.1080\/17445760.2012.668546","DOI":"10.1080\/17445760.2012.668546"},{"key":"7_CR10","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, February 22\u201325, 1999, pp. 173\u2013186. USENIX Association (1999). https:\/\/dl.acm.org\/citation.cfm?id=296824"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory. Springer Berlin Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Dolev, D.: Unanimity in an unknown and unreliable environment. In: 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, USA, 28\u201330 October 1981, pp. 159\u2013168. IEEE Computer Society (1981). https:\/\/doi.org\/10.1109\/SFCS.1981.53","DOI":"10.1109\/SFCS.1981.53"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Douceur, J.R.: The sybil attack. In: Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Cambridge, MA, USA, March 7\u20138, 2002, Revised Papers, pp. 251\u2013260 (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_24","DOI":"10.1007\/3-540-45748-8_24"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Drabkin, V., Friedman, R., Segal, M.: Efficient byzantine broadcast in wireless ad-hoc networks. In: 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June\u20131 July 2005, Yokohama, Japan, Proceedings, pp. 160\u2013169. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/DSN.2005.42","DOI":"10.1109\/DSN.2005.42"},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A Ferreira","year":"2004","unstructured":"Ferreira, A.: Building a reference combinatorial model for manets. IEEE Netw. 18(5), 24\u201329 (2004). https:\/\/doi.org\/10.1109\/MNET.2004.1337732","journal-title":"IEEE Netw."},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Fluschnik, T., Molter, H., Niedermeier, R., Renken, M., Zschoche, P.: Temporal graph classes: a view through temporal separators. Theor. Comput. Sci. 806, 197\u2013218 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.03.031","DOI":"10.1016\/j.tcs.2019.03.031"},{"key":"7_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, W. H (1979)"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002). https:\/\/doi.org\/10.1006\/jcss.2002.1829","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Koo, C.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Chaudhuri, S., Kutten, S. (eds.) Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John\u2019s, Newfoundland, Canada, July 25\u201328, 2004, pp. 275\u2013282. ACM (2004). https:\/\/doi.org\/10.1145\/1011767.1011807,","DOI":"10.1145\/1011767.1011807"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: Schulman, L.J. (ed.) Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5\u20138 June 2010, pp. 513\u2013522. ACM (2010). https:\/\/doi.org\/10.1145\/1806689.1806760","DOI":"10.1145\/1806689.1806760"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Maurer, A.: Self-stabilizing byzantine-resilient communication in dynamic networks. In: Bramas, Q., Oshman, R., Romano, P. (eds.) 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14\u201316, 2020, Strasbourg, France (Virtual Conference). LIPIcs, vol.\u00a0184, pp. 27:1\u201327:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.27","DOI":"10.4230\/LIPIcs.OPODIS.2020.27"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-33651-5_18","volume-title":"Distributed Computing","author":"A Maurer","year":"2012","unstructured":"Maurer, A., Tixeuil, S.: On Byzantine Broadcast in Loosely Connected Networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 253\u2013266. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_18"},{"issue":"11","key":"7_CR23","doi-asserted-by":"publisher","first-page":"3153","DOI":"10.1016\/J.JPDC.2014.07.010","volume":"74","author":"A Maurer","year":"2014","unstructured":"Maurer, A., Tixeuil, S.: Byzantine broadcast with fixed disjoint paths. J. Parallel Distrib. Comput. 74(11), 3153\u20133160 (2014). https:\/\/doi.org\/10.1016\/J.JPDC.2014.07.010","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"7_CR24","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TPDS.2014.2308190","volume":"26","author":"A Maurer","year":"2015","unstructured":"Maurer, A., Tixeuil, S.: Containing byzantine failures with control zones. IEEE Trans. Parallel Distrib. Syst. 26(2), 362\u2013370 (2015). https:\/\/doi.org\/10.1109\/TPDS.2014.2308190","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Maurer, A., Tixeuil, S.: Tolerating random byzantine failures in an unbounded network. Parallel Process. Lett. 26(1), 1650003:1\u20131650003:12 (2016). https:\/\/doi.org\/10.1142\/S0129626416500031","DOI":"10.1142\/S0129626416500031"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Maurer, A., Tixeuil, S., D\u00e9fago, X.: Communicating reliably in multihop dynamic networks despite byzantine failures. In: 34th IEEE Symposium on Reliable Distributed Systems, SRDS 2015, Montreal, QC, Canada, September 28\u2013October 1, 2015, pp. 238\u2013245. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/SRDS.2015.10","DOI":"10.1109\/SRDS.2015.10"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10(1), 96\u2013115 (1927). http:\/\/eudml.org\/doc\/211191","DOI":"10.4064\/fm-10-1-96-115"},{"issue":"2","key":"7_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-016-0279-6","volume":"30","author":"A Pagourtzis","year":"2017","unstructured":"Pagourtzis, A., Panagiotakos, G., Sakavalas, D.: Reliable broadcast with respect to topology knowledge. Distrib. Comput. 30(2), 87\u2013102 (2017). https:\/\/doi.org\/10.1007\/s00446-016-0279-6","journal-title":"Distrib. Comput."},{"issue":"5","key":"7_CR29","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/net.3230220503","volume":"22","author":"A Pelc","year":"1992","unstructured":"Pelc, A.: Reliable communication in networks with byzantine link failures. Networks 22(5), 441\u2013459 (1992). https:\/\/doi.org\/10.1002\/net.3230220503","journal-title":"Networks"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks 28(3), 143\u2013156 (1996)","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N"},{"issue":"3","key":"7_CR31","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.10.007","volume":"93","author":"A Pelc","year":"2005","unstructured":"Pelc, A., Peleg, D.: Broadcasting with locally bounded byzantine faults. Inf. Process. Lett. 93(3), 109\u2013115 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2004.10.007","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"7_CR32","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MWC.2010.5601959","volume":"17","author":"K Zeng","year":"2010","unstructured":"Zeng, K., Govindan, K., Mohapatra, P.: Non-cryptographic authentication and identification in wireless networks. IEEE Wireless Commun. 17(5), 56\u201362 (2010). https:\/\/doi.org\/10.1109\/MWC.2010.5601959","journal-title":"IEEE Wireless Commun."},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107, 72\u201392 (2020). https:\/\/doi.org\/10.1016\/J.JCSS.2019.07.006","DOI":"10.1016\/J.JCSS.2019.07.006"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26465-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:51:42Z","timestamp":1779601902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26465-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032264640","9783032264657"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26465-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2026.webspace.durham.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}