{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:46:48Z","timestamp":1742802408134},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,7,16]],"date-time":"2016-07-16T00:00:00Z","timestamp":1468627200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"European Social Fund (ESF) and Greek Ministry of Education","award":["THALIS-NTUA (MIS 379414)"],"award-info":[{"award-number":["THALIS-NTUA (MIS 379414)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00446-016-0279-6","type":"journal-article","created":{"date-parts":[[2016,7,16]],"date-time":"2016-07-16T13:48:09Z","timestamp":1468676889000},"page":"87-102","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Reliable broadcast with respect to topology knowledge"],"prefix":"10.1007","volume":"30","author":[{"given":"Aris","family":"Pagourtzis","sequence":"first","affiliation":[]},{"given":"Giorgos","family":"Panagiotakos","sequence":"additional","affiliation":[]},{"given":"Dimitris","family":"Sakavalas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,16]]},"reference":[{"issue":"1","key":"279_CR1","doi-asserted-by":"crossref","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 3(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"issue":"1","key":"279_CR2","doi-asserted-by":"crossref","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 40(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"279_CR3","unstructured":"Dolev, S., Liba, O., Schiller, E.M.: Self-stabilizing byzantine resilient topology discovery and message delivery. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) Stabilization, Safety, and Security of Distributed Systems\u201415th International Symposium, SSS \u201913, Osaka, Japan, November 13\u201316, 2013. Proceedings of Lecture Notes in Computer Science, vol. 8255, pp. 351\u2013353. Springer, 2013"},{"key":"279_CR4","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.: Efficient byzantine agreement secure against general adversaries. In: Kutten, S. (ed.) Distributed Computing, 12th International Symposium, DISC \u201998, Andros, Greece, September 24\u201326, 1998, Proceedings of Lecture Notes in Computer Science, vol. 1499 pp. 134\u2013148. Springer, 1998","DOI":"10.1007\/BFb0056479"},{"issue":"1","key":"279_CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"JA Garay","year":"1998","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement for $$n>3t$$ n > 3 t processors in $$t+ 1$$ t + 1 rounds. SIAM J. Comput. 27(1), 247\u2013290 (1998)","journal-title":"SIAM J. Comput."},{"key":"279_CR6","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. W. H. Freeman, New York (1979)"},{"key":"279_CR7","unstructured":"Martin H., Ueli, M.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: James E.B., Hagit A., (eds.), Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, PODC \u201997, Santa Barbara, California, USA, August 21\u201324, 1997, pp. 25\u201334. ACM, 1997"},{"issue":"12\u201313","key":"279_CR8","doi-asserted-by":"crossref","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. 110(12\u201313), 514\u2013517 (2010)","journal-title":"Inf. Process. Lett."},{"key":"279_CR9","doi-asserted-by":"crossref","unstructured":"Koo, C-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Chaudhuri, S., Kutten S., (eds.), Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC \u201904, St. John\u2019s, Newfoundland, Canada, July 25\u201328, 2004, pp. 275\u2013282. ACM, 2004","DOI":"10.1145\/1011767.1011807"},{"key":"279_CR10","unstructured":"Ashwin Kumar, M.V.N., Goundan, P.R., Srinathan, K, Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, PODC \u201902, Monterey, California, USA, July 21\u201324, 2002, pp. 193\u2013202, New York, NY, USA, ACM (2002)"},{"issue":"3","key":"279_CR11","doi-asserted-by":"crossref","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 Transact. Progr. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Transact. Progr. Lang. Syst."},{"key":"279_CR12","doi-asserted-by":"crossref","unstructured":"Litsas, C., Pagourtzis, A., Sakavalas, D.: A graph parameter that matches the resilience of the certified propagation algorithm. In: Cichon, J., Gebala, M., Klonowski, M. (eds.) Ad-hoc, Mobile, and Wireless Network\u201412th International Conference, ADHOC-NOW \u201913, Wroc\u0142aw, Poland, July 8\u201310, 2013. Proceedings of Lecture Notes in Computer Science, vol. 7960, pp. 269\u2013280. Springer, (2013)","DOI":"10.1007\/978-3-642-39247-4_23"},{"issue":"12","key":"279_CR13","doi-asserted-by":"crossref","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 Transact. Parallel Distrib. Syst. 20(12), 1777\u20131789 (2009)","journal-title":"IEEE Transact. Parallel Distrib. Syst."},{"key":"279_CR14","first-page":"243","volume":"2015","author":"A Pagourtzis","year":"2015","unstructured":"Pagourtzis, A., Panagiotakos, G., Sakavalas, D.: Reliable message transmission under partial knowledge. IACR Cryptol. ePrint Arch. 2015, 243 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"3","key":"279_CR15","doi-asserted-by":"crossref","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)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"279_CR16","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.ipl.2014.11.010","volume":"115","author":"L Tseng","year":"2015","unstructured":"Tseng, L., Vaidya, N., Bhandari, V.: Broadcast using certified propagation algorithm in presence of byzantine faults. Inf. Process. Lett. 115(4), 512\u2013514 (2015)","journal-title":"Inf. Process. Lett."},{"key":"279_CR17","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H.: Iterative approximate byzantine consensus under a generalized fault model. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) Distributed Computing and Networking, 14th International Conference, ICDCN \u201913, Mumbai, India, January 3\u20136, 2013. Proceedings of Lecture Notes in Computer Science, vol. 7730, pp. 72\u201386. Springer, (2013)","DOI":"10.1007\/978-3-642-35668-1_6"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0279-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0279-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0279-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0279-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:33:09Z","timestamp":1498329189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0279-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,16]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["279"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0279-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,16]]}}}