{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T15:26:07Z","timestamp":1763911567169,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T00:00:00Z","timestamp":1662595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T00:00:00Z","timestamp":1662595200000},"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":["Distrib. Comput."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00446-022-00436-8","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T09:03:06Z","timestamp":1662627786000},"page":"219-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Reaching consensus for asynchronous distributed key generation"],"prefix":"10.1007","volume":"36","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Jovanovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mary","family":"Maller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Meiklejohn","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"}]},{"given":"Alin","family":"Tomescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,8]]},"reference":[{"key":"436_CR1","doi-asserted-by":"publisher","unstructured":"Kokoris\u00a0Kogias, E., Malkhi, D., Spiegelman, A.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS\u201920, pp. 1751\u20131767. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3372297.3423364","DOI":"10.1145\/3372297.3423364"},{"key":"436_CR2","doi-asserted-by":"crossref","unstructured":"Syta, E., Jovanovic, P., Kokoris-Kogias, E., Gailly, N., Gasser, L., Khoffi, I., Fischer, M.J., Ford, B.: Scalable bias-resistant distributed randomness. In: 38th IEEE Symposium on Security and Privacy (2017)","DOI":"10.1109\/SP.2017.45"},{"key":"436_CR3","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, NY, USA (2019). https:\/\/doi.org\/10.1145\/3293611.3331612","DOI":"10.1145\/3293611.3331612"},{"key":"436_CR4","unstructured":"Kokoris-Kogias, E., Alp, E.C., Gasser, L., Jovanovic, P., Syta, E., Ford, B.: CALYPSO: Private Data Management for Decentralized Ledgers. Cryptology ePrint Archive, Report 2018\/209. To appear in VLDB 2021 (2018)"},{"key":"436_CR5","unstructured":"Kate, A., Huang, Y., Goldberg, I.: Distributed Key Generation in the Wild. Cryptology ePrint Archive, Report 2012\/377. https:\/\/eprint.iacr.org\/2012\/377 (2012)"},{"key":"436_CR6","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":"436_CR7","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 \u201993, pp. 42\u201351. Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/167088.167105","DOI":"10.1145\/167088.167105"},{"key":"436_CR8","doi-asserted-by":"publisher","unstructured":"Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: Proceedings of the 8th International Conference on Principles of Distributed Systems. OPODIS\u201904, pp. 229\u2013239. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/11516798_17","DOI":"10.1007\/11516798_17"},{"key":"436_CR9","doi-asserted-by":"crossref","unstructured":"Gurkan, K., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Aggregatable Distributed Key Generation. Cryptology ePrint Archive, Report 2021\/005. https:\/\/eprint.iacr.org\/2021\/005 (2021)","DOI":"10.1007\/978-3-030-77870-5_6"},{"key":"436_CR10","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology\u2014CRYPTO 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.) Advances in Cryptology\u2014CRYPTO 2001, pp. 524\u2013541. Springer, Berlin (2001)"},{"issue":"4","key":"436_CR11","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."},{"key":"436_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-36095-4_17","volume-title":"Topics in Cryptology\u2014CT-RSA 2013","author":"M Backes","year":"2013","unstructured":"Backes, M., Datta, A., Kate, A.: Asynchronous computational VSS with reduced communication complexity. In: Dawson, E. (ed.) Topics in Cryptology\u2014CT-RSA 2013, pp. 259\u2013276. Springer, Berlin (2013)"},{"key":"436_CR13","doi-asserted-by":"publisher","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for Byzantine Agreement. In: Proceedings of the First ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - PODC \u201982, pp. 132\u2013140. ACM Press, New York, NY, USA (1982). https:\/\/doi.org\/10.1145\/800220.806690","DOI":"10.1145\/800220.806690"},{"key":"436_CR14","doi-asserted-by":"publisher","unstructured":"Bracha, G.: An asynchronous [(n - 1)\/3]-resilient consensus protocol. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 154\u2013162. Association for Computing Machinery, New York, NY, USA (1984). https:\/\/doi.org\/10.1145\/800222.806743","DOI":"10.1145\/800222.806743"},{"key":"436_CR15","doi-asserted-by":"crossref","unstructured":"Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Distributed Computing. 19th International Conference, DISC 2005, Cracow, Poland, September 26\u201329, 2005, Proceedings, pp. 503\u2013504. Springer, Berlin (2005)","DOI":"10.1007\/11561927_42"},{"issue":"2","key":"436_CR16","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":"3","key":"436_CR17","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). https:\/\/doi.org\/10.1007\/s00145-005-0318-0","journal-title":"J. Cryptol."},{"key":"436_CR18","doi-asserted-by":"publisher","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Proceedings of the 9th ACM Conference on Computer and Communications Security. CCS \u201902, pp. 88\u201397. Association for Computing Machinery, New York, NY, USA (2002). https:\/\/doi.org\/10.1145\/586110.586124","DOI":"10.1145\/586110.586124"},{"issue":"3","key":"436_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/1085126.1085127","volume":"8","author":"L Zhou","year":"2005","unstructured":"Zhou, L., Schneider, F.B., Van Renesse, R.: APSS: proactive secret sharing in asynchronous systems. ACM Trans. Inf. Syst. Secur. 8(3), 259\u2013286 (2005). https:\/\/doi.org\/10.1145\/1085126.1085127","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"436_CR20","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 \u201919, pp. 347\u2013356. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"},{"key":"436_CR21","doi-asserted-by":"publisher","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. PODC \u201920, pp. 129\u2013138. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3382734.3405707","DOI":"10.1145\/3382734.3405707"},{"key":"436_CR22","unstructured":"Abraham, I., Stern, G.: Information theoretic hotstuff. In: OPODIS. LIPIcs, vol. 184, pp. 11\u201311116. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020)"},{"issue":"2","key":"436_CR23","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.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985). https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"key":"436_CR24","doi-asserted-by":"publisher","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing. PODC \u201983, pp. 27\u201330. Association for Computing Machinery, New York, NY, USA (1983). https:\/\/doi.org\/10.1145\/800221.806707","DOI":"10.1145\/800221.806707"},{"key":"436_CR25","doi-asserted-by":"publisher","unstructured":"Patra, A., Choudhary, A., Pandu\u00a0Rangan, C.: Simple and efficient asynchronous byzantine agreement with optimal resilience. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing. PODC \u201909, pp. 92\u2013101. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1582716.1582736","DOI":"10.1145\/1582716.1582736"},{"key":"436_CR26","doi-asserted-by":"publisher","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing. PODC \u201908, pp. 405\u2013414. Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1400751.1400804","DOI":"10.1145\/1400751.1400804"},{"key":"436_CR27","doi-asserted-by":"publisher","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. PODC \u201918, pp. 295\u2013304. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3212734.3212735","DOI":"10.1145\/3212734.3212735"},{"key":"436_CR28","doi-asserted-by":"crossref","unstructured":"Katz, J., Koo, C.: On expected constant-round protocols for byzantine agreement. Electron. Colloquium Comput. Complex. 13(028) (2006)","DOI":"10.1007\/11818175_27"},{"key":"436_CR29","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 \u201993, pp. 52\u201361. Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/167088.167109","DOI":"10.1145\/167088.167109"},{"key":"436_CR30","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 \u201994, pp. 183\u2013192. Association for Computing Machinery, New York, NY, USA (1994). https:\/\/doi.org\/10.1145\/197917.198088","DOI":"10.1145\/197917.198088"},{"key":"436_CR31","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous mpc. In: Proceedings of the Advances in Crypotology 13th International Conference on Theory and Application of Cryptology and Information Security. ASIACRYPT\u201907, pp. 376\u2013392. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-76900-2_23"},{"key":"436_CR32","first-page":"473","volume-title":"Automata, Languages and Programming\u2014ICALP 2008. Lecture Notes in Computer Science","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. In: Aceto, L., Halldorsson, M.M., Ingolfsdottir, A. (eds.) Automata, Languages and Programming\u2014ICALP 2008. Lecture Notes in Computer Science, vol. 5126, pp. 473\u2013485. Springer, Berlin (2008)"},{"key":"436_CR33","doi-asserted-by":"publisher","unstructured":"Choudhury, A., Patra, A.: Optimally resilient asynchronous mpc with linear communication complexity. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking. ICDCN \u201915. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2684464.2684470","DOI":"10.1145\/2684464.2684470"},{"key":"436_CR34","doi-asserted-by":"crossref","unstructured":"Gagol, A., Lesniak, D., Straszak, D., Swietek, M.: Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes (2019)","DOI":"10.1145\/3318041.3355467"},{"key":"436_CR35","doi-asserted-by":"crossref","unstructured":"Das, S., Xiang, Z., Ren, L.: Asynchronous data dissemination and its applications. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2705\u20132721 (2021)","DOI":"10.1145\/3460120.3484808"},{"key":"436_CR36","doi-asserted-by":"crossref","unstructured":"Gao, Y., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Efficient Asynchronous Byzantine Agreement without Private Setups (2021). arXiv:2106.07831","DOI":"10.1109\/ICDCS54860.2022.00032"},{"key":"436_CR37","unstructured":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris-Kogias, L., Ren, L.: Practical Asynchronous Distributed Key Generation. Cryptology ePrint Archive, Paper 2021\/1591. https:\/\/eprint.iacr.org\/2021\/1591 (2021)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00436-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-022-00436-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00436-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T18:02:39Z","timestamp":1690826559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-022-00436-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,8]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["436"],"URL":"https:\/\/doi.org\/10.1007\/s00446-022-00436-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2022,9,8]]},"assertion":[{"value":"15 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}