{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:59:00Z","timestamp":1778065140653,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780226","type":"print"},{"value":"9783031780233","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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-78023-3_15","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:51:02Z","timestamp":1733136662000},"page":"451-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Asynchronous Agreement on a Core Set in Constant Expected Time and\u00a0More Efficient Asynchronous VSS and MPC"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9568-7674","authenticated-orcid":false,"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0846-9773","authenticated-orcid":false,"given":"Gilad","family":"Ashsarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8036-4407","authenticated-orcid":false,"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0358-2689","authenticated-orcid":false,"given":"Gilad","family":"Stern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"15_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: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography, TCC 2022, Part I. LNCS, vol. 13747, pp. 384\u2013414. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_14","DOI":"10.1007\/978-3-031-22318-1_14"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 251\u2013281. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_9","DOI":"10.1007\/978-3-031-30617-4_9"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Perfect asynchronous MPC with linear communication overhead. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part V. LNCS, vol. 14655, pp. 280\u2013309. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_10","DOI":"10.1007\/978-3-031-58740-5_10"},{"key":"15_CR4","unstructured":"Abraham, I., Asharov, G., Patra, A., Stern, G.: Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC. Cryptology ePrint Archive, Paper 2023\/1130 (2023). https:\/\/eprint.iacr.org\/2023\/1130"},{"issue":"4","key":"15_CR5","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. Distrib. Comput. 35(4), 333\u2013355 (2022)","journal-title":"Distrib. Comput."},{"key":"15_CR6","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: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 363\u2013373 (2021)","DOI":"10.1145\/3465084.3467914"},{"key":"15_CR7","doi-asserted-by":"publisher","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. ACM, New York, July 2019. https:\/\/doi.org\/10.1145\/3293611.3331612","DOI":"10.1145\/3293611.3331612"},{"key":"15_CR8","unstructured":"Abraham, I., Stern, G.: Information theoretic hotstuff. In: OPODIS. LIPIcs, vol. 184, pp. 11:1\u201311:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020)"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Alhaddad, N., Das, S., Duan, S., Ren, L., Varia, M., Xiang, Z., Zhang, H.: Balanced byzantine reliable broadcast with near-optimal communication and improved computation. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC 2022, pp. 399\u2013417. Association for Computing Machinery, New York. (2022). https:\/\/doi.org\/10.1145\/3519270.3538475","DOI":"10.1145\/3519270.3538475"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Bangalore, L., Choudhury, A., Patra, A.: Almost-surely terminating asynchronous byzantine agreement revisited. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp. 295\u2013304 (2018)","DOI":"10.1145\/3212734.3212735"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 52\u201361. Association for Computing Machinery, New York (1993). https:\/\/doi.org\/10.1145\/167088.167109","DOI":"10.1145\/167088.167109"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., El-Yaniv, R.: Resilient-optimal interactive consistency in constant time. Distrib. Comput. 16(4), 249\u2013262 (2003). https:\/\/doi.org\/10.1007\/s00446-002-0083-3","DOI":"10.1007\/s00446-002-0083-3"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1994, pp. 183\u2013192. Association for Computing Machinery, New York (1994). https:\/\/doi.org\/10.1145\/197917.198088","DOI":"10.1145\/197917.198088"},{"issue":"2","key":"15_CR14","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."},{"key":"15_CR15","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Ph.D. thesis, Citeseer (1996)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48000-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Cohen, A., Lindell, Y.: A simpler variant of universally composable security for standard multiparty computation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 3\u201322. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_1"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 42\u201351. Association for Computing Machinery, New York (1993). https:\/\/doi.org\/10.1145\/167088.167105","DOI":"10.1145\/167088.167105"},{"key":"15_CR18","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, 22\u201325 February 1999, pp. 173\u2013186. USENIX Association (1999). https:\/\/dl.acm.org\/citation.cfm?id=296824"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory (2016)","DOI":"10.1109\/TIT.2016.2614685"},{"key":"15_CR20","unstructured":"Choudhury, A., Patra, A.: On the communication efficiency of statistically-secure asynchronous MPC with optimal resilience. Cryptology ePrint Archive, Paper 2022\/913 (2022). https:\/\/eprint.iacr.org\/2022\/913"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Cohen, R., Forghani, P., Garay, J., Patel, R., Zikas, V.: Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-48624-1_16"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"Das, S., Duan, S., Liu, S., Momose, A., Ren, L., Shoup, V.: Asynchronous consensus without trusted setup or public-key cryptography. Cryptology ePrint Archive, Paper 2024\/677 (2024). https:\/\/doi.org\/10.1145\/3658644.3670327. https:\/\/eprint.iacr.org\/2024\/677","DOI":"10.1145\/3658644.3670327"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Duan, S., Wang, X., Zhang, H.: Practical signature-free asynchronous common subset in constant time. IACR Cryptol. ePrint Arch. p. 154 (2023). https:\/\/eprint.iacr.org\/2023\/154","DOI":"10.1145\/3576915.3616633"},{"key":"15_CR24","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"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985). https:\/\/doi.org\/10.1145\/3149.214121","DOI":"10.1145\/3149.214121"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-26951-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"V Goyal","year":"2019","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 85\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_4"},{"issue":"2","key":"15_CR27","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.Y.: On expected constant-round protocols for byzantine agreement. J. Comput. Syst. Sci. 75(2), 91\u2013112 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR28","unstructured":"Nielsen, J.B.: MPC techniques series, part 4: Beaver\u2019s trick (2021). https:\/\/medium.com\/partisia-blockchain\/beavers-trick-e275e79839cc"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Patra, A., Choudhury, A., Rangan, C.P.: Efficient asynchronous verifiable secret sharing and multiparty computation. J. Cryptol. 28(1), 49\u2013109 (2015). https:\/\/doi.org\/10.1007\/s00145-013-9172-7","DOI":"10.1007\/s00145-013-9172-7"},{"key":"15_CR30","doi-asserted-by":"publisher","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, pp. 347\u2013356. Association for Computing Machinery, New York (2019).https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"}],"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-78023-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:04:49Z","timestamp":1733137489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}