{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:02:39Z","timestamp":1784736159207,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":37,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551156","type":"print"},{"value":"9789819551163","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5116-3_6","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:24Z","timestamp":1765106544000},"page":"163-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Byzantine Agreement in\u00a0the\u00a0Presence of\u00a0Message Drops"],"prefix":"10.1007","author":[{"given":"Hanwen","family":"Feng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenliang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiang","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuchen","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00446-022-00428-8","volume":"36","author":"I Abraham","year":"2023","unstructured":"Abraham, I., et al.: Communication complexity of byzantine agreement, revisited. Distributed Comput. 36(1), 3\u201328 (2023)","journal-title":"Distributed Comput."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous byzantine agreement with expected O(1) rounds, expected o(n$$ ^{\\text{2}}$$) communication, and optimal resilience. In: Financial Cryptography. Lecture Notes in Computer Science, vol. 11598, pp. 320\u2013334. Springer (2019)","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"6_CR3","unstructured":"Abraham, I., Dolev, D., Kagan, A., Stern, G.: Brief announcement: authenticated consensus in synchronous systems with mixed faults. In: DISC. LIPIcs, vol.\u00a0246, pp. 38:1\u201338:3. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Reaching consensus for asynchronous distributed key generation. In: PODC, pp. 363\u2013373. ACM (2021)","DOI":"10.1145\/3465084.3467914"},{"key":"6_CR5","unstructured":"Abraham, I., Nayak, K., Ren, L., Xiang, Z.: Brief announcement: byzantine agreement, broadcast and state machine replication with optimal good-case latency. In: DISC. LIPIcs, vol.\u00a0179, pp. 47:1\u201347:3. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J.: On the adaptive security of the threshold BLS signature scheme. In: CCS, pp. 193\u2013207. ACM (2022)","DOI":"10.1145\/3548606.3560656"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Basu, S., Tomescu, A., Abraham, I., Malkhi, D., Reiter, M.K., Sirer, E.G.: Efficient verifiable secret sharing with share recovery in BFT protocols. In: CCS, pp. 2387\u20132402. ACM (2019)","DOI":"10.1145\/3319535.3354207"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Brazitikos, K., Zikas, V.: General adversary structures in byzantine agreement and multi-party computation with active and omission corruption. IACR Cryptol. ePrint Arch. 209 (2024)","DOI":"10.1007\/978-3-031-78023-3_7"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: CCS, pp. 88\u201397. ACM (2002)","DOI":"10.1145\/586110.586124"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Civit, P., Dzulfikar, M.A., Gilbert, S., Guerraoui, R., Komatovic, J., Vidigueira, M.: DARE to agree: byzantine agreement with optimal resilience and adaptive communication. In: PODC, pp. 145\u2013156. ACM (2024)","DOI":"10.1145\/3662158.3662792"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Deligios, G., Hirt, M., Liu-Zhang, C.-D.: Round-efficient byzantine agreement and multi-party computation with asynchronous fallback. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 623\u2013653. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_21","DOI":"10.1007\/978-3-030-90459-3_21"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Distler, T.: Byzantine fault-tolerant state-machine replication from a systems perspective. ACM Comput. Surv. 54(1), 24:1\u201324:38 (2022)","DOI":"10.1145\/3436728"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM 32(1), 191\u2013204 (1985)","journal-title":"J. ACM"},{"issue":"4","key":"6_CR15","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."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Eldefrawy, K., Loss, J., Terner, B.: How byzantine is a send corruption? In: ACNS. Lecture Notes in Computer Science, vol. 13269, pp. 684\u2013704. Springer (2022)","DOI":"10.1007\/978-3-031-09234-3_34"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Feng, H., Lu, Z., Tang, Q.: Dragon: decentralization at the cost of representation after arbitrary grouping and its applications to sub-cubic DKG and interactive consistency. In: PODC, pp. 469\u2013479. ACM (2024)","DOI":"10.1145\/3662158.3662771"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. In: PODC, pp. 59\u201370. ACM (1985)","DOI":"10.1145\/323596.323602"},{"key":"6_CR20","unstructured":"Fitzi, M., Garay, J.A.: Efficient and player-optimal strong consensus. IACR Cryptol. ePrint Arch. 85 (2002)"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Fitzi, M., Gisin, N., Maurer, U., von Rotz, O.: Unconditional byzantine agreement and multi-party computation secure against dishonest minorities from scratch. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 482\u2013501. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_32","DOI":"10.1007\/3-540-46035-7_32"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Perry, K.J.: A continuum of failure models for distributed computing. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 153\u2013165. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-56188-9_11","DOI":"10.1007\/3-540-56188-9_11"},{"key":"6_CR23","unstructured":"Hadzilacos, V.: Issues of Fault Tolerance in Concurrent Computations (Databases, Reliability, Transactions, Agreement Protocols, Distributed Computing). Ph.D. thesis, Harvard University (1985)"},{"key":"6_CR24","doi-asserted-by":"publisher","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","DOI":"10.1007\/11818175_27"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Koo, C.-Y.: Secure computation with partial message loss. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 502\u2013521. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_26","DOI":"10.1007\/11681878_26"},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","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":"6_CR27","doi-asserted-by":"crossref","unstructured":"Loss, J., Shi, K., Stern, G.: Consensus in the presence of overlapping faults and total omission. In: TCC (1). Lecture Notes in Computer Science, vol. 15364, pp. 353\u2013382. Springer (2024)","DOI":"10.1007\/978-3-031-78011-0_12"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Loss, J., Stern, G.: Zombies and ghosts: optimal byzantine agreement in the presence of omission faults. In: TCC (4). Lecture Notes in Computer Science, vol. 14372, pp. 395\u2013421. Springer (2023)","DOI":"10.1007\/978-3-031-48624-1_15"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-MVBA: optimal multi-valued validated asynchronous byzantine agreement, revisited. In: PODC, pp. 129\u2013138. ACM (2020)","DOI":"10.1145\/3382734.3405707"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Massey, J.L.: Review of \u2018theory and practice of error control codes\u2019 (blahut, r.e.; 1983). IEEE Trans. Inf. Theory 31(4), 553\u2013554 (1985)","DOI":"10.1109\/TIT.1985.1057072"},{"key":"6_CR31","unstructured":"Momose, A., Ren, L.: Optimal communication complexity of authenticated byzantine agreement. In: DISC. LIPIcs, vol.\u00a0209, pp. 32:1\u201332:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"6_CR32","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. In: DISC. LIPIcs, vol.\u00a0179, pp. 28:1\u201328:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"6_CR33","unstructured":"Parv\u00e9dy, P.R., Raynal, M.: Uniform agreement despite process omission failures. In: IPDPS, p.\u00a0212. IEEE Computer Society (2003)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Consensus in synchronous systems: a concise guided tour. In: PRDC, pp. 221\u2013228. IEEE Computer Society (2002)","DOI":"10.1109\/PRDC.2002.1185641"},{"issue":"4","key":"6_CR36","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1109\/71.667895","volume":"9","author":"H Siu","year":"1998","unstructured":"Siu, H., Chin, Y., Yang, W.: Byzantine agreement in the presence of mixed faults on processors and links. IEEE Trans. Parallel Distributed Syst. 9(4), 335\u2013345 (1998)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Zikas, V., Hauser, S., Maurer, U.: Realistic failures in secure multi-party computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 274\u2013293. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_17","DOI":"10.1007\/978-3-642-00457-5_17"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5116-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:27Z","timestamp":1765106547000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5116-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551156","9789819551163"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5116-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}