{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:01:22Z","timestamp":1780074082453,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642336508","type":"print"},{"value":"9783642336515","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_18","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T09:25:32Z","timestamp":1352798732000},"page":"253-266","source":"Crossref","is-referenced-by-count":7,"title":["On Byzantine Broadcast in Loosely Connected Networks"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Maurer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGraw-Hill Publishing Company, New York (1998)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Aguilera, M.K., Aspnes, J. (eds.) PODC, pp. 138\u2013147. ACM (2005)","DOI":"10.1145\/1073814.1073841"},{"key":"18_CR3","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI, pp. 173\u2013186 (1999)"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The Byzantine generals strike again. Journal of Algorithms\u00a03(1), 14\u201330 (1982)","journal-title":"Journal of Algorithms"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Drabkin, V., Friedman, R., Segal, M.: Efficient byzantine broadcast in wireless ad-hoc networks. In: DSN, pp. 160\u2013169. IEEE Computer Society (2005)","DOI":"10.1109\/DSN.2005.42"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-15763-9_47","volume-title":"Distributed Computing","author":"S. Dubois","year":"2010","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: The Impact of Topology on Byzantine Containment in Stabilization. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 495\u2013509. Springer, Heidelberg (2010)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-16023-3_10","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S. Dubois","year":"2010","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: On Byzantine Containment Properties of the min + 1 Protocol. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 96\u2013110. Springer, Heidelberg (2010)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: Bounding the impact of unbounded attacks in stabilization. In: IEEE Transactions on Parallel and Distributed Systems, TPDS (2011)","DOI":"10.1109\/TPDS.2011.158"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-24100-0_14","volume-title":"Distributed Computing","author":"S. Dubois","year":"2011","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: Maximum Metric Spanning Tree Made Byzantine Tolerant. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 150\u2013164. Springer, Heidelberg (2011)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Koo, C.-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Chaudhuri, S., Kutten, S. (eds.) PODC, pp. 275\u2013282. ACM (2004)","DOI":"10.1145\/1011767.1011807"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1-3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(02)00325-0","volume":"299","author":"D. Malkhi","year":"2003","unstructured":"Malkhi, D., Mansour, Y., Reiter, M.K.: Diffusion without false rumors: on propagating updates in a Byzantine environment. Theoretical Computer Science\u00a0299(1-3), 289\u2013306 (2003)","journal-title":"Theoretical Computer Science"},{"key":"18_CR13","first-page":"90","volume-title":"The 20th IEEE Symposium on Reliable Distributed Systems (SRDS 2001)","author":"D. Malkhi","year":"2001","unstructured":"Malkhi, D., Reiter, M., Rodeh, O., Sella, Y.: Efficient update diffusion in byzantine environments. In: The 20th IEEE Symposium on Reliable Distributed Systems (SRDS 2001), pp. 90\u201398. IEEE, Washington (2001)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-49823-0_31","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T. Masuzawa","year":"2006","unstructured":"Masuzawa, T., Tixeuil, S.: Bounding the Impact of Unbounded Attacks in Stabilization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 440\u2013453. Springer, Heidelberg (2006)"},{"issue":"1","key":"18_CR15","first-page":"1","volume":"1","author":"T. Masuzawa","year":"2007","unstructured":"Masuzawa, T., Tixeuil, S.: Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults. International Journal of Principles and Applications of Information Science and Technology (PAIST)\u00a01(1), 1\u201313 (2007)","journal-title":"International Journal of Principles and Applications of Information Science and Technology (PAIST)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Maurer, A., Tixeuil, S.: Limiting byzantine influence in multihop asynchronous networks. In: IEEE International Conference on Distributed Computing Systems, ICDCS (2012)","DOI":"10.1109\/ICDCS.2012.15"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-002-0082-4","volume":"16","author":"Y. Minsky","year":"2003","unstructured":"Minsky, Y., Schneider, F.B.: Tolerating malicious gossip. Distributed Computing\u00a016(1), 49\u201368 (2003)","journal-title":"Distributed Computing"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), pp. 22\u201329. IEEE Computer Society (2002)","DOI":"10.1109\/RELDIS.2002.1180170"},{"issue":"12","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1109\/TPDS.2009.25","volume":"20","author":"M. Nesterenko","year":"2009","unstructured":"Nesterenko, M., Tixeuil, S.: Discovering network topology in the presence of byzantine nodes. IEEE Transactions on Parallel and Distributed Systems (TPDS)\u00a020(12), 1777\u20131789 (2009)","journal-title":"IEEE Transactions on Parallel and Distributed Systems (TPDS)"},{"issue":"3","key":"18_CR20","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.\u00a093(3), 109\u2013115 (2005)","journal-title":"Inf. Process. Lett."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11516798_21","volume-title":"Principles of Distributed Systems","author":"Y. Sakurai","year":"2005","unstructured":"Sakurai, Y., Ooshita, F., Masuzawa, T.: A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol.\u00a03544, pp. 283\u2013298. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T19:21:17Z","timestamp":1745176877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}