{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:00:44Z","timestamp":1774022444001,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159817","type":"print"},{"value":"9783031159824","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15982-4_15","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T04:40:54Z","timestamp":1665463254000},"page":"439-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Gossiping for\u00a0Communication-Efficient Broadcast"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Tsimos","sequence":"first","affiliation":[]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Hubert Chan, T.-H., Dolev, K.N.D., Pass, R., Ren, L., Shi, E.: Communication complexity of byzantine agreement, revisited. In: Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pp. 317\u2013326 (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-56880-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Baum","year":"2020","unstructured":"Baum, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Efficient constant-round MPC with identifiable abort and public verifiability. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 562\u2013592. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_20"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-030-64375-1_13","volume-title":"Theory of Cryptography","author":"E Blum","year":"2020","unstructured":"Blum, E., Katz, J., Liu-Zhang, C.-D., Loss, J.: Asynchronous byzantine agreement with subquadratic communication. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 353\u2013380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_13"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: byzantine resilient random membership sampling. In: Proceedings of ACM PODC, pp. 145\u2013154 (2008)","DOI":"10.1145\/1400751.1400772"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Boyle, E., Ran, Goel, A.: Breaking the $$o(\\sqrt{n})$$-bit barrier: Byzantine agreement with polylog bits per party. In: Proceedings of ACM PODC, pp. 319\u2013330 (2021)","DOI":"10.1145\/3465084.3467897"},{"key":"15_CR6","unstructured":"Buterin, V.: A guide to 99% fault tolerant consensus. Blog Post (2018)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13, 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-030-45388-6_9","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"T-HH Chan","year":"2020","unstructured":"Chan, T.-H.H., Pass, R., Shi, E.: Sublinear-round byzantine agreement under corrupt majority. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 246\u2013265. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_9"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Demers, A.J.: Epidemic algorithms for replicated database maintenance. In: Proceedings of ACM PODC, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","DOI":"10.1137\/0212045"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of ACM STOC, pp. 148\u2013161 (1988)","DOI":"10.1145\/62212.62225"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-04355-0_46","volume-title":"Distributed Computing","author":"M Fitzi","year":"2009","unstructured":"Fitzi, M., Nielsen, J.B.: On the number of synchronous rounds sufficient for authenticated byzantine agreement. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 449\u2013463. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04355-0_46"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Koo, C.-Y., Ostrovsky, R.: Round complexity of authenticated broadcast with a dishonest majority. In: Proceedings of IEEE FOCS, pp. 658\u2013668 (2007)","DOI":"10.1109\/FOCS.2007.44"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement in $$t+1$$ rounds. In: Proceedings of ACM STOC, pp. 31\u201341 (1993)","DOI":"10.1145\/167088.167101"},{"key":"15_CR15","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.A.: Scalable Byzantine reliable broadcast. In: Proceedings of DISC, vol. 146, pp. 22:1\u201322:16 (2019)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1109\/TNET.2006.876186","volume":"14","author":"ZJ Haas","year":"2006","unstructured":"Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE\/ACM Trans. Netw. 14, 479\u2013491 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Breaking the O(n$${}^{\\text{2}}$$) bit barrier: scalable byzantine agreement with an adaptive adversary. In: Proceedings of ACM PODC, pp. 420\u2013429 (2010)","DOI":"10.1145\/1835698.1835798"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: Proceedings of ACM-SIAM SODA, pp. 990\u2013999 (2006)","DOI":"10.1145\/1109557.1109667"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. Trans. Programm. Lang. Syst. 4, 382\u2013401 (1982)","journal-title":"Trans. Programm. Lang. Syst."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. In: Proceedings of ACM PODC, pp. 303\u2013312 (2014)","DOI":"10.1145\/2611462.2611498"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Mansour, Y., Reiter, M.K.: On diffusing updates in a byzantine environment. In: Proceedings of the IEEE Symposium on Reliable Distributed Systems, pp. 134\u2013143 (1999)","DOI":"10.1109\/RELDIS.1999.805090"},{"key":"15_CR22","volume-title":"Jesper Buus Nielsen, and S\u00f8ren Eller Thomsen","author":"C Matt","year":"2022","unstructured":"Matt, C.: Jesper Buus Nielsen, and S\u00f8ren Eller Thomsen. Formalizing delayed adaptive corruptions and the security of flooding networks, Cryptology ePrint Archive (2022)"},{"key":"15_CR23","unstructured":"Micali, S.: Very simple and efficient byzantine agreement. In: Proceedings of ITCS, vol. 67, pp. 6:1\u20136:1 (2017)"},{"key":"15_CR24","volume-title":"Optimal and player-replaceable consensus with an honest majority","author":"S Micali","year":"2017","unstructured":"Micali, S., Vaikuntanathan, V.: Optimal and player-replaceable consensus with an honest majority. Technical report, MIT (2017)"},{"key":"15_CR25","unstructured":"Momose, A., Ren, L.: Optimal communication complexity of authenticated byzantine agreement. In: Proceedings of DISC, pp. 32:1\u201332:16 (2021)"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-64375-1_14","volume-title":"Theory of Cryptography","author":"J Wan","year":"2020","unstructured":"Wan, J., Xiao, H., Shi, E., Devadas, S.: Expected constant round byzantine broadcast under dishonest majority. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 381\u2013411. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_14"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15982-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:19Z","timestamp":1760133979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15982-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159817","9783031159824"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15982-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}