{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:29:42Z","timestamp":1767313782144,"version":"3.48.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070234","type":"print"},{"value":"9783032070241","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07024-1_20","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:25:28Z","timestamp":1767313528000},"page":"345-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Optimal Parallel Broadcast Under a\u00a0Dishonest Majority"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Collins","sequence":"first","affiliation":[]},{"given":"Sisi","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[]},{"given":"Giorgos","family":"Tsimos","sequence":"additional","affiliation":[]},{"given":"Haochen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Asharov, G., Patra, A., Stern, G.: Perfectly secure asynchronous agreement on a core set in constant expected time. In: TCC (2024)","DOI":"10.1007\/978-3-031-78023-3_15"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of byzantine agreement, revisited. In: PODC (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"20_CR3","unstructured":"Abraham, I., Nayak, K., Shrestha, N.: Communication and round efficient parallel broadcast protocols. Cryptol. ePrint Arch. (2023)"},{"key":"20_CR4","unstructured":"Alhaddad, N., Duan, S., Varia, M., Zhang, H.: Succinct erasure coding proof systems. Cryptol. ePrint Arch. (2021)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Asharov, G., Chandramouli, A.: Perfect (parallel) broadcast in constant expected rounds via statistical vss. In: EUROCRYPT, pp. 310\u2013339. Springer (2024)","DOI":"10.1007\/978-3-031-58740-5_11"},{"key":"20_CR6","unstructured":"Blum, E., Boyle, E., Cohen, R., Liu-Zhang, C.D.: Communication lower bounds for cryptographic broadcast protocols. In: DISC (2023)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Blum, E., Katz, J., Liu-Zhang, C.D., Loss, J.: Asynchronous byzantine agreement with subquadratic communication. In: TCC. Springer (2020)","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 514\u2013532. Springer (2001)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: CRYPTO, pp. 524\u2013541. Springer (2001)","DOI":"10.1007\/3-540-44647-8_31"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00145-006-0442-5","volume":"20","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. J. Cryptol. 20, 265\u2013294 (2007)","journal-title":"J. Cryptol."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Chan, T.H.H., Pass, R., Shi, E.: Sublinear-round byzantine agreement under corrupt majority. In: PKC, pp. 246\u2013265. Springer (2020)","DOI":"10.1007\/978-3-030-45388-6_9"},{"key":"20_CR12","unstructured":"Civit, P., Gilbert, S., Guerraoui, R., Komatovic, J., Monti, M., Vidigueira, M.: Every bit counts in consensus. DISC (2023)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Duan, S., Wang, X., Zhang, H.: Fin: Practical signature-free asynchronous common subset in constant time. In: ACM CCS (2023)","DOI":"10.1145\/3576915.3616633"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: ASIACRYPT (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Katz, J., Koo, C.Y.: On expected constant-round protocols for byzantine agreement. In: CRYPTO, pp. 445\u2013462 (2006)","DOI":"10.1007\/11818175_27"},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1989727.1989732","volume":"58","author":"V King","year":"2011","unstructured":"King, V., Saia, J.: Breaking the $$o(n^2)$$ bit barrier: scalable Byzantine agreement with an adaptive adversary. JACM 58(4), 18 (2011)","journal-title":"JACM"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA (2006)","DOI":"10.1145\/1109557.1109667"},{"key":"20_CR19","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. DISC (2020)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Tsimos, G., Loss, J., Papamanthou, C.: Gossiping for communication-efficient broadcast. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15982-4_15"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Wan, J., Xiao, H., Shi, E., Devadas, S.: Expected constant round byzantine broadcast under dishonest majority. In: TCC, pp. 381\u2013411. Springer (2020)","DOI":"10.1007\/978-3-030-64375-1_14"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07024-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:25:30Z","timestamp":1767313530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07024-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070234","9783032070241"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07024-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Miyakojima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"14 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc25.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}