{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:55:14Z","timestamp":1743112514187,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030670863"},{"type":"electronic","value":"9783030670870"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67087-0_8","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:17:39Z","timestamp":1610587059000},"page":"112-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults"],"prefix":"10.1007","author":[{"given":"Silvia","family":"Bonomi","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Farina","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.tcs.2015.10.019","volume":"609","author":"F Bonnet","year":"2016","unstructured":"Bonnet, F., D\u00e9fago, X., Nguyen, T.D., Potop-Butucaru, M.: Tight bound on mobile Byzantine agreement. Theoret. Comput. Sci. 609, 361\u2013373 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.10.019","journal-title":"Theoret. Comput. Sci."},{"key":"8_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"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1186\/s13173-019-0090-x","volume":"25","author":"S Bonomi","year":"2019","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","journal-title":"J. Braz. Comput. Soc."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2017.08.020","volume":"709","author":"S Bonomi","year":"2018","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M.: Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register. Theoret. Comput. Sci. 709, 64\u201379 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.08.020","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"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\u201329 September 2017, pp. 154\u2013163. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/SRDS.2017.20","DOI":"10.1109\/SRDS.2017.20"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-03232-6_28","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Bonomi","year":"2018","unstructured":"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\u2013403. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_28"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2018.08.001","volume":"758","author":"S Bonomi","year":"2019","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Approximate agreement under mobile Byzantine faults. Theoret. Comput. Sci. 758, 17\u201329 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.08.001","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"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\u201330 June 1995, pp. 83\u201388. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/FTCS.1995.466995","DOI":"10.1109\/FTCS.1995.466995"},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15260-3","volume-title":"Introduction to Reliable and Secure Distributed Programming","author":"C Cachin","year":"2011","unstructured":"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","edition":"2"},{"key":"8_CR10","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 (1981). https:\/\/doi.org\/10.1109\/SFCS.1981.53","DOI":"10.1109\/SFCS.1981.53"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0020438","volume-title":"Distributed Algorithms","author":"JA Garay","year":"1994","unstructured":"Garay, J.A.: Reaching (and maintaining) agreement in the presence of mobile faults (extended abstract). In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 253\u2013264. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0020438"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-39247-4_23","volume-title":"Ad-hoc, Mobile, and Wireless Network","author":"C Litsas","year":"2013","unstructured":"Litsas, C., Pagourtzis, A., Sakavalas, D.: A graph parameter that matches the resilience of the certified propagation algorithm. In: Cicho\u0144, J., G\u0229bala, M., Klonowski, M. (eds.) ADHOC-NOW 2013. LNCS, vol. 7960, pp. 269\u2013280. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39247-4_23"},{"issue":"11","key":"8_CR13","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."},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Maurer, A., Tixeuil, S.: Self-stabilizing Byzantine broadcast. In: 33rd IEEE International Symposium on Reliable Distributed Systems, SRDS 2014, Nara, Japan, 6\u20139 October 2014, pp. 152\u2013160. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/SRDS.2014.10","DOI":"10.1109\/SRDS.2014.10"},{"issue":"2","key":"8_CR15","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."},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1650003:1","DOI":"10.1142\/S0129626416500031","volume":"26","author":"A Maurer","year":"2016","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","journal-title":"Parallel Process. Lett."},{"key":"8_CR17","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, 28 September\u20131 October 2015, pp. 238\u2013245. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/SRDS.2015.10","DOI":"10.1109\/SRDS.2015.10"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"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\u201321 August 1991, pp. 51\u201359. ACM (1991). https:\/\/doi.org\/10.1145\/112600.112605","DOI":"10.1145\/112600.112605"},{"issue":"2","key":"8_CR19","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":"8_CR20","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"},{"issue":"3","key":"8_CR21","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":"1\u20133","key":"8_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(85)80042-5","volume":"64","author":"R Reischuk","year":"1985","unstructured":"Reischuk, R.: A new solution for the Byzantine generals problem. Inf. Control 64(1\u20133), 23\u201342 (1985). https:\/\/doi.org\/10.1016\/S0019-9958(85)80042-5","journal-title":"Inf. Control"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"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\u20133 November 2018, pp. 1\u20138. IEEE (2018). https:\/\/doi.org\/10.1109\/NCA.2018.8548345","DOI":"10.1109\/NCA.2018.8548345"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-03850-6_17","volume-title":"Principles of Distributed Systems","author":"T Sasaki","year":"2013","unstructured":"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\u2013250. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03850-6_17"},{"issue":"4","key":"8_CR25","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.ipl.2014.11.010","volume":"115","author":"L Tseng","year":"2015","unstructured":"Tseng, L., Vaidya, N.H., Bhandari, V.: Broadcast using certified propagation algorithm in presence of Byzantine faults. Inf. Process. Lett. 115(4), 512\u2013514 (2015). https:\/\/doi.org\/10.1016\/j.ipl.2014.11.010","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67087-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:49:26Z","timestamp":1610588966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67087-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670863","9783030670870"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67087-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually. Three invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}