{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:18Z","timestamp":1740098898816,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662557501"},{"type":"electronic","value":"9783662557518"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_29","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:32:49Z","timestamp":1502796769000},"page":"367-380","source":"Crossref","is-referenced-by-count":0,"title":["Reliable Communication via Semilattice Properties of Partial 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","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-46035-7_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"Y Desmedt","year":"2002","unstructured":"Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 502\u2013517. Springer, Heidelberg (2002). doi:\n10.1007\/3-540-46035-7_33"},{"issue":"1","key":"29_CR2","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":"29_CR3","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). \nhttp:\/\/doi.acm.org\/10.1145\/138027.138036","journal-title":"J. ACM"},{"key":"29_CR4","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. In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol. 7853, pp. 42\u201357. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-40148-0_4"},{"key":"29_CR5","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, pp. 25\u201334. ACM (1997)","DOI":"10.1145\/259380.259412"},{"issue":"12\u201313","key":"29_CR6","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":"29_CR7","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"},{"key":"29_CR8","doi-asserted-by":"crossref","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). \nhttp:\/\/doi.acm.org\/10.1145\/571825.571858","DOI":"10.1145\/571825.571858"},{"issue":"3","key":"29_CR9","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 Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"29_CR10","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., Ge\u0229bala, M., Klonowski, M. (eds.) ADHOC-NOW 2013. LNCS, vol. 7960, pp. 269\u2013280. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39247-4_23"},{"issue":"12","key":"29_CR11","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 Trans. Parallel Distrib. Syst. 20(12), 1777\u20131789 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"29_CR12","unstructured":"Pagourtzis, A., Panagiotakos, G., Sakavalas, D.: Brief announcement: reliable message transmission under partial knowledge and general adversaries. In: Giakkoupis, G. (ed.) Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, 25-28 July 2016. pp. 203\u2013205. ACM (2016). \nhttp:\/\/doi.acm.org\/10.1145\/2933057.2933080"},{"issue":"2","key":"29_CR13","doi-asserted-by":"crossref","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). \nhttp:\/\/dx.doi.org\/10.1007\/s00446-016-0279-6","journal-title":"Distrib. Comput."},{"issue":"3","key":"29_CR14","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."},{"key":"29_CR15","volume-title":"Lattices and Ordered Sets","author":"S Roman","year":"2008","unstructured":"Roman, S.: Lattices and Ordered Sets. Springer Science & Business Media, Heidelberg (2008)"},{"key":"29_CR16","unstructured":"Shankar, B., Gopal, P., Srinathan, K., Rangan, C.P.: Unconditionally reliable message transmission in directed networks. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 1048\u20131055. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2008). \nhttp:\/\/dl.acm.org\/citation.cfm?id=1347082.1347197"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Patra, A., Choudhary, A., Rangan, C.P.: Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, ASIACCS 2009, pp. 171\u2013182. ACM, New York (2009). \nhttp:\/\/doi.acm.org\/10.1145\/1533057.1533083","DOI":"10.1145\/1533057.1533083"},{"key":"29_CR18","unstructured":"Srinathan, K., Rangan, C.P.: Possibility and complexity of probabilistic reliable communication in directed networks. In: Ruppert, E., Malkhi, D. (eds.) Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, 23-26 July 2006, pp. 265\u2013274. ACM (2006). \nhttp:\/\/doi.acm.org\/10.1145\/1146381.1146421"},{"issue":"4","key":"29_CR19","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). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019014002609","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:41:12Z","timestamp":1502797272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}