{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:21:33Z","timestamp":1764645693318,"version":"3.46.0"},"publisher-location":"Cham","reference-count":83,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486234"},{"type":"electronic","value":"9783031486241"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48624-1_16","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"422-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Concurrent Asynchronous Byzantine Agreement in\u00a0Expected-Constant Rounds, Revisited"],"prefix":"10.1007","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Pouyan","family":"Forghani","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Garay","sequence":"additional","affiliation":[]},{"given":"Rutvik","family":"Patel","sequence":"additional","affiliation":[]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"16_CR1","unstructured":"Abraham, I., Asharov, G., Patra, A., Stern, G.: Perfectly secure asynchronous agreement on a core set in constant expected time. IACR Cryptology ePrint Archive, Report 2023\/1130 (2023). https:\/\/eprint.iacr.org\/2023\/1130"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In: 27th ACM PODC, pp. 405\u2013414. ACM (2008)","DOI":"10.1145\/1400751.1400804"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00446-021-00416-4","volume":"35","author":"I Abraham","year":"2022","unstructured":"Abraham, I., Dolev, D., Stern, G.: Revisiting asynchronous fault tolerant computation with optimal resilience. Distributed Comput. 35(4), 333\u2013355 (2022)","journal-title":"Distributed Comput."},{"key":"16_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: 40th ACM PODC, pp. 363\u2013373. ACM (2021)","DOI":"10.1145\/3465084.3467914"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: 38th ACM PODC, pp. 337\u2013346. ACM (2019)","DOI":"10.1145\/3293611.3331612"},{"issue":"8","key":"16_CR6","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1137\/090751906","volume":"39","author":"H Attiya","year":"2010","unstructured":"Attiya, H., Censor-Hillel, K.: Lower bounds for randomized consensus under a weak adversary. SIAM J. Comput. 39(8), 3885\u20133904 (2010)","journal-title":"SIAM J. Comput."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-48285-7_36","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"D Beaver","year":"1994","unstructured":"Beaver, D., So, N.: Global, unpredictable bit generation without broadcast. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 424\u2013434. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_36"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-76900-2_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2007","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 376\u2013392. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_23"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In: 2nd ACM PODC, pp. 27\u201330. ACM (1983)","DOI":"10.1145\/800221.806707"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: 25th ACM STOC, pp. 52\u201361. ACM Press (1993)","DOI":"10.1145\/167088.167109"},{"key":"16_CR11","unstructured":"Ben-Or, M., El-Yaniv, R.: Interactive consistency in constant expected time. Technical report, Inst. of Math. and Comp. Sci., Hebrew University, Jerusalem (1988)"},{"issue":"4","key":"16_CR12","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":"16_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: 13th ACM PODC, pp. 183\u2013192. ACM (1994)","DOI":"10.1145\/197917.198088"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus (extended abstract). In: 30th FOCS, pp. 410\u2013415. IEEE Computer Society Press (1989)","DOI":"10.1109\/SFCS.1989.63511"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-030-56880-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Blum","year":"2020","unstructured":"Blum, E., Liu-Zhang, C.-D., Loss, J.: Always have a backup plan: fully secure synchronous\u00a0MPC\u00a0with\u00a0asynchronous\u00a0fallback. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 707\u2013731. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_25"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-61769-8_4","volume-title":"Distributed Algorithms","author":"M Borcherding","year":"1996","unstructured":"Borcherding, M.: Levels of authentication in distributed agreement. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 40\u201355. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61769-8_4"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"issue":"4","key":"16_CR19","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824\u2013840 (1985)","journal-title":"J. ACM"},{"key":"16_CR20","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"},{"issue":"3","key":"16_CR21","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantinople: practical asynchronous byzantine agreement using cryptography. J. Cryptol. 18(3), 219\u2013246 (2005)","journal-title":"J. Cryptol."},{"key":"16_CR22","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Ph.D. thesis, Weizmann Institute of Science (1996)"},{"issue":"5","key":"16_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 1\u201394 (2020)","journal-title":"J. ACM"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: 25th ACM STOC, pp. 42\u201351. ACM Press (1993)","DOI":"10.1145\/167088.167105"},{"key":"16_CR25","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. Full version of [24] (1998). https:\/\/www.cs.tau.ac.il\/~canetti\/materials\/cr93.ps"},{"key":"16_CR26","unstructured":"Chan, T.H., Pass, R., Shi, E.: Round complexity of Byzantine agreement, revisited. IACR Cryptology ePrint Archive, Report 2019\/886 (2019). https:\/\/eprint.iacr.org\/2019\/886"},{"key":"16_CR27","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, Part II. LNCS, vol. 12111, pp. 246\u2013265. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_9"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th ACM STOC, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"issue":"3","key":"16_CR29","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/65950.65956","volume":"36","author":"B Chor","year":"1989","unstructured":"Chor, B., Merritt, M., Shmoys, D.B.: Simple constant-time consensus protocols in realistic failure models. J. ACM 36(3), 591\u2013614 (1989)","journal-title":"J. ACM"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-49387-8_8","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"R Cohen","year":"2016","unstructured":"Cohen, R.: Asynchronous secure multiparty computation in constant time. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016, Part II. LNCS, vol. 9615, pp. 183\u2013207. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_8"},{"issue":"3","key":"16_CR31","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00145-018-9279-y","volume":"32","author":"R Cohen","year":"2019","unstructured":"Cohen, R., Coretti, S., Garay, J., Zikas, V.: Probabilistic termination and composability of cryptographic protocols. J. Cryptol. 32(3), 690\u2013741 (2019)","journal-title":"J. Cryptol."},{"issue":"2","key":"16_CR32","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s00145-021-09377-0","volume":"34","author":"R Cohen","year":"2021","unstructured":"Cohen, R., Coretti, S., Garay, J.A., Zikas, V.: Round-preserving parallel composition of probabilistic-termination cryptographic protocols. J. Cryptol. 34(2), 12 (2021)","journal-title":"J. Cryptol."},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Cohen, R., Forghani, P., Garay, J.A., Patel, R., Zikas, V.: Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited. IACR Cryptology ePrint Archive, Report 2023\/1003 (2023). https:\/\/eprint.iacr.org\/2023\/1003","DOI":"10.1007\/978-3-031-48624-1_16"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Cohen, R., Garay, J., Zikas, V.: Completeness theorems for adaptively secure broadcast (2023), cRYPTO \u201923 (2023, to appear)","DOI":"10.1007\/978-3-031-38557-5_1"},{"issue":"2","key":"16_CR35","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s00145-022-09421-7","volume":"35","author":"R Cohen","year":"2022","unstructured":"Cohen, R., Haitner, I., Makriyannis, N., Orland, M., Samorodnitsky, A.: On the round complexity of randomized byzantine agreement. J. Cryptol. 35(2), 10 (2022)","journal-title":"J. Cryptol."},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1007\/978-3-662-53890-6_33","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Coretti","year":"2016","unstructured":"Coretti, S., Garay, J., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 998\u20131021. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_33"},{"issue":"4","key":"16_CR37","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":"16_CR38","doi-asserted-by":"crossref","unstructured":"Duan, S., Wang, X., Zhang, H.: Practical signature-free asynchronous common subset in constant time. Cryptology ePrint Archive (2023), cCS \u201923 (2023, to appear)","DOI":"10.1145\/3576915.3616633"},{"issue":"2","key":"16_CR39","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":"16_CR40","doi-asserted-by":"crossref","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Approximating clique is almost NP-complete (preliminary version). In: 32nd FOCS, pp. 2\u201312. IEEE Computer Society Press (1991)","DOI":"10.1109\/SFCS.1991.185341"},{"key":"16_CR41","unstructured":"Feldman, P.: Asynchronous byzantine agreement in constant expected time (1989), unpublished manuscript"},{"key":"16_CR42","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: 20th ACM STOC, pp. 148\u2013161. ACM Press (1988)","DOI":"10.1145\/62212.62225"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BFb0035770","volume-title":"Automata, Languages and Programming","author":"P Feldman","year":"1989","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic algorithm for synchronous Byzantine agreement. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 341\u2013378. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035770"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Feldman, P.N.: Optimal Algorithms for Byzantine Agreement. Ph.D. thesis, Massachusetts Institute of Technology (1988)","DOI":"10.1145\/62212.62225"},{"issue":"4","key":"16_CR45","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"16_CR46","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"16_CR47","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"MJ Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986)","journal-title":"Distrib. Comput."},{"issue":"2","key":"16_CR48","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"16_CR49","unstructured":"Fitzi, M.: Generalized communication and security models in Byzantine agreement. Ph.D. thesis, ETH Zurich, Z\u00fcrich, Switzerland (2003)"},{"key":"16_CR50","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: 22nd ACM PODC, pp. 211\u2013220. ACM (2003)","DOI":"10.1145\/872035.872066"},{"key":"16_CR51","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":"16_CR52","doi-asserted-by":"crossref","unstructured":"Gao, Y., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Efficient asynchronous byzantine agreement without private setups. In: 42nd ICDCS, pp. 246\u2013257. IEEE (2022)","DOI":"10.1109\/ICDCS54860.2022.00032"},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Koo, C., Ostrovsky, R.: Round complexity of authenticated broadcast with a dishonest majority. In: 48th FOCS, pp. 658\u2013668. IEEE Computer Society Press (2007)","DOI":"10.1109\/FOCS.2007.44"},{"key":"16_CR54","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement for n $$>$$ 3t processors in t + 1 rounds. SIAM J. Comput. 27(1), 247\u2013290 (1998)","DOI":"10.1137\/S0097539794265232"},{"key":"16_CR55","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-031-06944-4_4","volume-title":"EUROCRYPT 2022, Part I","author":"D Ghinea","year":"2022","unstructured":"Ghinea, D., Goyal, V., Liu-Zhang, C.: Round-optimal byzantine agreement. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 96\u2013119. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_4"},{"key":"16_CR56","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"16_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11426639_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Hirt","year":"2005","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 322\u2013340. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_19"},{"key":"16_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70583-3_39","volume-title":"Automata, Languages and Programming","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 473\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_39"},{"key":"16_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-13190-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Hirt","year":"2010","unstructured":"Hirt, M., Zikas, V.: Adaptively secure broadcast. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 466\u2013485. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_24"},{"key":"16_CR60","unstructured":"Karlin, A.R., Yao, A.C.: Probabilistic lower bounds for Byzantine agreement and clock synchronization (1986). unpublished manuscript"},{"issue":"2","key":"16_CR61","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2008.08.001","volume":"75","author":"J Katz","year":"2009","unstructured":"Katz, J., Koo, C.: On expected constant-round protocols for byzantine agreement. J. Comput. Syst. Sci. 75(2), 91\u2013112 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"issue":"3","key":"16_CR63","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":"16_CR64","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: Sequential composition of protocols without simultaneous termination. In: 21st ACM PODC, pp. 203\u2013212. ACM (2002)","DOI":"10.1145\/571825.571859"},{"issue":"6","key":"16_CR65","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1145\/1217856.1217857","volume":"53","author":"Y Lindell","year":"2006","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: On the composition of authenticated byzantine agreement. J. ACM 53(6), 881\u2013917 (2006)","journal-title":"J. ACM"},{"key":"16_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-64840-4_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"C-D Liu-Zhang","year":"2020","unstructured":"Liu-Zhang, C.-D., Loss, J., Maurer, U., Moran, T., Tschudi, D.: MPC with synchronous security and asynchronous responsiveness. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 92\u2013119. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_4"},{"key":"16_CR67","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-MVBA: optimal multi-valued validated asynchronous byzantine agreement, revisited. In: 39th ACM PODC, pp. 129\u2013138. ACM (2020)","DOI":"10.1145\/3382734.3405707"},{"key":"16_CR68","unstructured":"Micali, S.: Very simple and efficient byzantine agreement. In: ITCS 2017. LIPIcs, vol. 4266, pp. 6:1\u20136:1. Schloss Dagstuhl (2017)"},{"key":"16_CR69","unstructured":"Micali, S.: Very simple and efficient byzantine agreement. In: ITCS 2017. LIPIcs, vol.\u00a04266, pp. 6:1\u20136:1. Schloss Dagstuhl (2017)"},{"key":"16_CR70","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Raynal, M.: Signature-free asynchronous byzantine systems: from multivalued to binary consensus with t $$<$$ n\/3, O(n$$^{2}$$) messages, and constant time. Acta Informatica 54(5), 501\u2013520 (2017)","DOI":"10.1007\/s00236-016-0269-y"},{"key":"16_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-45708-9_26","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"JB Nielsen","year":"2002","unstructured":"Nielsen, J.B.: A threshold pseudorandom function construction and its applications. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 401\u2013416. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_26"},{"key":"16_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-25873-2_4","volume-title":"Principles of Distributed Systems","author":"A Patra","year":"2011","unstructured":"Patra, A.: Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 34\u201349. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_4"},{"issue":"2","key":"16_CR73","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-013-0200-5","volume":"27","author":"A Patra","year":"2014","unstructured":"Patra, A., Choudhury, A., Rangan, C.P.: Asynchronous byzantine agreement with optimal resilience. Distrib. Comput. 27(2), 111\u2013146 (2014)","journal-title":"Distrib. Comput."},{"issue":"2","key":"16_CR74","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(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"16_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-55210-3_195","volume-title":"STACS 92","author":"B Pfitzmann","year":"1992","unstructured":"Pfitzmann, B., Waidner, M.: Unconditional Byzantine agreement for any number of faulty processors. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 337\u2013350. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55210-3_195"},{"key":"16_CR76","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: 24th FOCS. pp. 403\u2013409. IEEE Computer Society Press (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"16_CR77","unstructured":"de Souza, L.F., Kuznetsov, P., Tonkikh, A.: Distributed randomness from approximate agreement. In: 36th DISC. LIPIcs, vol. 246, pp. 24:1\u201324:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"16_CR78","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-031-31368-4_20","volume-title":"PKC 2023, Part I","author":"S Srinivasan","year":"2023","unstructured":"Srinivasan, S., Loss, J., Malavolta, G., Nayak, K., Papamanthou, C., Thyagarajan, S.A.K.: Transparent batchable time-lock puzzles and applications to byzantine consensus. In: PKC 2023, Part I. LNCS, pp. 554\u2013584. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_20"},{"issue":"2","key":"16_CR79","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending binary byzantine agreement to multivalued byzantine agreement. Inf. Process. Lett. 18(2), 73\u201376 (1984)","journal-title":"Inf. Process. Lett."},{"key":"16_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-030-64375-1_15","volume-title":"Theory of Cryptography","author":"J Wan","year":"2020","unstructured":"Wan, J., Xiao, H., Devadas, S., Shi, E.: Round-efficient byzantine broadcast under strongly adaptive and majority corruptions. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 412\u2013456. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_15"},{"key":"16_CR81","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, Part I. LNCS, vol. 12550, pp. 381\u2013411. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_14"},{"key":"16_CR82","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"16_CR83","doi-asserted-by":"crossref","unstructured":"Zhang, H., Duan, S.: PACE: fully parallelizable BFT from reproposable byzantine agreement. In: ACM CCS 2022, pp. 3151\u20133164. ACM (2022)","DOI":"10.1145\/3548606.3559348"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48624-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:11Z","timestamp":1764118991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48624-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486234","9783031486241"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48624-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}