{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:15:27Z","timestamp":1761401727972},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662451731"},{"type":"electronic","value":"9783662451748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45174-8_8","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T15:28:20Z","timestamp":1412004500000},"page":"107-121","source":"Crossref","is-referenced-by-count":8,"title":["Reliable Broadcast with Respect to Topology Knowledge"],"prefix":"10.1007","author":[{"given":"Aris","family":"Pagourtzis","sequence":"first","affiliation":[]},{"given":"Giorgos","family":"Panagiotakos","sequence":"additional","affiliation":[]},{"given":"Dimitris","family":"Sakavalas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","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. J. Algorithms\u00a03(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM\u00a040(1), 17\u201347 (1993), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/138027.138036","journal-title":"J. ACM"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-40148-0_4","volume-title":"Networked Systems","author":"S. Dolev","year":"2013","unstructured":"Dolev, S., Liba, O., Schiller, E.M.: Self-stabilizing byzantine resilient topology discovery and message delivery - (extended abstract). In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol.\u00a07853, pp. 42\u201357. Springer, Heidelberg (2013)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Distributed Computing","author":"M. Fitzi","year":"1998","unstructured":"Fitzi, M., Maurer, U.M.: Efficient byzantine agreement secure against general adversaries. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 134\u2013148. Springer, Heidelberg (1998)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement for n\u2009>\u20093t processors in t\u2009+\u20091 rounds. SIAM J. Comput.\u00a027(1), 247\u2013290 (1998)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.M.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: Burns, J.E., Attiya, H. (eds.) PODC 1997, pp. 25\u201334. ACM (1997)","DOI":"10.1145\/259380.259412"},{"issue":"12-13","key":"8_CR8","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ipl.2010.04.003","volume":"110","author":"A. Ichimura","year":"2010","unstructured":"Ichimura, A., Shigeno, M.: A new parameter for a broadcast algorithm with locally bounded byzantine faults. Inf. Process. Lett.\u00a0110(12-13), 514\u2013517 (2010)","journal-title":"Inf. Process. Lett."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Chaudhuri, S., Kutten, S. (eds.) PODC 2004, pp. 275\u2013282. ACM (2004)","DOI":"10.1145\/1011767.1011807"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/571825.571858","volume-title":"Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing, PODC 2002","author":"M.V.N.A. Kumar","year":"2002","unstructured":"Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing, PODC 2002, pp. 193\u2013202. ACM, New York (2002), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/571825.571858"},{"issue":"3","key":"8_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."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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\u0119bala, M., Klonowski, M. (eds.) ADHOC-NOW 2013. LNCS, vol.\u00a07960, pp. 269\u2013280. Springer, Heidelberg (2013)"},{"issue":"12","key":"8_CR13","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 faults. IEEE Trans. Parallel Distrib. Syst.\u00a020(12), 1777\u20131789 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"8_CR14","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":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-35668-1_6","volume-title":"Distributed Computing and Networking","author":"L. Tseng","year":"2013","unstructured":"Tseng, L., Vaidya, N.: Iterative approximate byzantine consensus under a generalized fault model. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol.\u00a07730, pp. 72\u201386. Springer, Heidelberg (2013)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H., Bhandari, V.: Broadcast using certified propagation algorithm in presence of byzantine faults. CoRR abs\/1209.4620 (2012)","DOI":"10.21236\/ADA568117"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45174-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:48:44Z","timestamp":1559004524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45174-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662451731","9783662451748"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45174-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}