{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:30Z","timestamp":1783576830553,"version":"3.55.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031910913","type":"print"},{"value":"9783031910920","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-91092-0_4","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T12:57:58Z","timestamp":1745758678000},"page":"96-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MiniCast: Minimizing the\u00a0Communication Complexity of\u00a0Reliable Broadcast"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Locher","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6996-5660","authenticated-orcid":false,"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Asharov, G.: Gradecast in synchrony and reliable broadcast in asynchrony with optimal resilience, efficiency, and unconditional security. In: Proceedings of 43rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 392\u2013398 (2022)","DOI":"10.1145\/3519270.3538451"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Alhaddad, N., et al.: Balanced byzantine reliable broadcast with near-optimal communication and improved computation. In: Proceedings of 43rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 399\u2013417 (2022)","DOI":"10.1145\/3519270.3538475"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90054-X","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Annual International Cryptology Conference, pp. 524\u2013541 (2001)","DOI":"10.1007\/3-540-44647-8_31"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/11561927_42","volume-title":"Distributed Computing","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 503\u2013504. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561927_42"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Das, S., Xiang, Z., Ren, L.: Asynchronous data dissemination and its applications. In: Proceedings of ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 2705\u20132721 (2021)","DOI":"10.1145\/3460120.3484808"},{"key":"4_CR7","unstructured":"Das, S., Xiang, Z., Ren, L.: Near-optimal Balanced Reliable Broadcast and Asynchronous Verifiable Information Dispersal. Cryptology ePrint Archive, Report 2022\/052 (2022). https:\/\/ia.cr\/2022\/052"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Lin, S., Al-Naffouri, T.Y., Han, Y.S., Chung, W.: Novel polynomial basis with fast fourier transform and its application to reed-solomon erasure codes. IEEE Trans. Inf. Theory 62(11), 6284\u20136299 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2608892","DOI":"10.1109\/TIT.2016.2608892"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Lin, S., Chung, W.: An efficient (n, k) information dispersal algorithm for high code rate system over fermat fields. IEEE Commun. Lett. 16(12), 2036\u20132039 (2012). https:\/\/doi.org\/10.1109\/LCOMM.2012.112012.121322","DOI":"10.1109\/LCOMM.2012.112012.121322"},{"key":"4_CR10","unstructured":"Locher, T.: Byzantine Reliable Broadcast with Low Communication and Time Complexity (2024). arXiv:2404.08070. http:\/\/arxiv.org\/abs\/2404.08070"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"4_CR12","unstructured":"Shoup, V.: Sing a song of Simplex. Cryptology ePrint Archive, Paper 2023\/1916 (2023). https:\/\/eprint.iacr.org\/2023\/1916"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91092-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:22:52Z","timestamp":1749493372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91092-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910913","9783031910920"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91092-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}