{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:29:45Z","timestamp":1767313785122,"version":"3.48.0"},"publisher-location":"Cham","reference-count":32,"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_19","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:25:36Z","timestamp":1767313536000},"page":"327-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Communication and\u00a0Round Efficient Parallel Broadcast Protocols"],"prefix":"10.1007","author":[{"given":"Nibesh","family":"Shrestha","sequence":"first","affiliation":[]},{"given":"Ittai","family":"Abraham","sequence":"additional","affiliation":[]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Asymptotically free broadcast in constant expected time via packed vss. In: Theory of Cryptography: 20th International Conference, TCC 2022, Chicago, IL, USA, 7\u201310 November 2022, Proceedings, Part I, pp. 384\u2013414. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_14","DOI":"10.1007\/978-3-031-22318-1_14"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I., Asharov, G., Yanai, A.: Efficient perfectly secure computation with optimal resilience. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 66\u201396. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_3","DOI":"10.1007\/978-3-030-90453-1_3"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of byzantine agreement, revisited. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 317\u2013326 (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-030-32101-7_20","volume-title":"Financial Cryptography and Data Security","author":"I Abraham","year":"2019","unstructured":"Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous byzantine agreement with expected O(1) rounds, expected $$O(n^2)$$ communication, and optimal resilience. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 320\u2013334. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_20"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 337\u2013346 (2019)","DOI":"10.1145\/3293611.3331612"},{"key":"19_CR6","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"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00446-002-0083-3","volume":"16","author":"M Ben-Or","year":"2003","unstructured":"Ben-Or, M., El-Yaniv, R.: Resilient-optimal interactive consistency in constant time. Distrib. Comput. 16(4), 249\u2013262 (2003)","journal-title":"Distrib. Comput."},{"key":"19_CR8","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Providing Sound Foundations for Cryptography, pp. 351\u2013371 (2019)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Green, M., Tromer, E., Virza, M.: Secure sampling of public parameters for succinct zero knowledge proofs. In: 2015 IEEE Symposium on Security and Privacy, pp. 287\u2013304. IEEE (2015)","DOI":"10.1109\/SP.2015.25"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bhat, A., Shrestha, N., Luo, Z., Kate, A., Nayak, K.: Randpiper\u2013reconfiguration-friendly random beacons with quadratic communication. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 3502\u20133524 (2021)","DOI":"10.1145\/3460120.3484574"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"19_CR12","unstructured":"Bowe, S., Gabizon, A., Miers, I.: Scalable multi-party computation for ZK-SNARK parameters in the random beacon model. In: Cryptology ePrint Archive (2017)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"C Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524\u2013541. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_31"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"R Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98\u2013116. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_7"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-53015-3_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"R Cohen","year":"2016","unstructured":"Cohen, R., Coretti, S., Garay, J., Zikas, V.: Probabilistic termination and composability of cryptographic protocols. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 240\u2013269. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_9"},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 148\u2013161 (1988)","DOI":"10.1145\/62212.62225"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, pp. 211\u2013220 (2003)","DOI":"10.1145\/872035.872066"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued byzantine agreement. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 163\u2013168 (2006)","DOI":"10.1145\/1146381.1146407"},{"key":"19_CR20","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: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 658\u2013668. IEEE (2007)","DOI":"10.1109\/FOCS.2007.44"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 445\u2013462. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_27"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: Sequential composition of protocols without simultaneous termination. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 203\u2013212 (2002)","DOI":"10.1145\/571825.571859"},{"key":"19_CR23","unstructured":"Loss, J., Moran, T.: Combining asynchronous and synchronous byzantine agreement: the best of both worlds. In: Cryptology ePrint Archive (2018)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-MVBA: optimal multi-valued validated asynchronous byzantine agreement, revisited. In: Proceedings of the 39th Symposium on Principles of Distributed Computing, pp. 129\u2013138 (2020)","DOI":"10.1145\/3382734.3405707"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. Pomerance, C. (eds) Advances in Cryptology \u2014 CRYPTO 1987. Conference on the Theory and Application of Cryptographic Techniques, pp. 369\u2013378. Springer (1987). https:\/\/doi.org\/10.1007\/3-540-48184-2_32","DOI":"10.1007\/3-540-48184-2_32"},{"key":"19_CR26","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. In: 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_19"},{"issue":"2","key":"19_CR28","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"19_CR29","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":"19_CR30","unstructured":"Shrestha, N., Abraham, I., Nayak, K.: Communication and round efficient parallel broadcast protocols. Cryptology ePrint Archive, Paper 2023\/1172 (2023)"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Shrestha, N., Bhat, A., Kate, A., Nayak, K.: Synchronous distributed key generation without broadcasts. In: IACR Communications in Cryptology, vol. 1, no. 2 (2024)","DOI":"10.62056\/ayfhsgvtw"},{"key":"19_CR32","doi-asserted-by":"publisher","unstructured":"Tsimos, G., Loss, J., Papamanthou, C.: Gossiping for communication-efficient broadcast. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology\u2013CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, 15\u201318 August 2022, Proceedings, Part III, pp. 439\u2013469. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_15","DOI":"10.1007\/978-3-031-15982-4_15"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:25:37Z","timestamp":1767313537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07024-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070234","9783032070241"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07024-1_19","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"}}]}}