{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:07:08Z","timestamp":1764133628297},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T00:00:00Z","timestamp":1682294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T00:00:00Z","timestamp":1682294400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00145-023-09457-3","type":"journal-article","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T21:02:00Z","timestamp":1682370120000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries"],"prefix":"10.1007","volume":"36","author":[{"given":"Ananya","family":"Appan","sequence":"first","affiliation":[]},{"given":"Anirudh","family":"Chandramouli","sequence":"additional","affiliation":[]},{"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,24]]},"reference":[{"key":"9457_CR1","doi-asserted-by":"crossref","unstructured":"I.\u00a0Abraham, D.\u00a0Dolev, G.\u00a0Stern, Revisiting asynchronous fault tolerant computation with optimal resilience, in PODC (ACM, 2020), pp. 139\u2013148","DOI":"10.1145\/3382734.3405722"},{"key":"9457_CR2","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, Efficient multiparty protocols using circuit randomization, in J.\u00a0Feigenbaum, editor, CRYPTO, vol. 576 of Lecture Notes in Computer Science (Springer, 1991), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9457_CR3","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Beerliov\u00e1-Trub\u00edniov\u00e1, M.\u00a0Hirt, Simple and efficient perfectly-secure asynchronous MPC, in ASIACRYPT, vol. 4833 of Lecture Notes in Computer Science (Springer, 2007), pp. 376\u2013392.","DOI":"10.1007\/978-3-540-76900-2_23"},{"key":"9457_CR4","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, R.\u00a0Canetti, O.\u00a0Goldreich, Asynchronous secure computation, in STOC (ACM, 1993), pp. 52\u201361.","DOI":"10.1145\/167088.167109"},{"key":"9457_CR5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in STOC (ACM, 1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9457_CR6","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, B.\u00a0Kelmer, T.\u00a0Rabin, Asynchronous secure computations with optimal resilience (extended abstract), in PODC (ACM, 1994), pp. 183\u2013192.","DOI":"10.1145\/197917.198088"},{"key":"9457_CR7","unstructured":"R.\u00a0Canetti, Studies in secure multiparty computation and applications. PhD thesis, Weizmann Institute, Israel (1995)"},{"key":"9457_CR8","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Universally composable security: a new paradigm for cryptographic protocols, in FOCS (IEEE Computer Society, 2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"5","key":"9457_CR9","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"R.\u00a0Canetti, Universally Composable Security. J. ACM67(5), 28:1\u201328:94 (2020)","journal-title":"J. ACM"},{"key":"9457_CR10","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, T.\u00a0Rabin, Fast asynchronous byzantine agreement with optimal resilience, in STOC (1993), pp. 42\u201351","DOI":"10.1145\/167088.167105"},{"key":"9457_CR11","doi-asserted-by":"crossref","unstructured":"A.\u00a0Choudhury, Almost-surely terminating asynchronous byzantine agreement against general adversaries with optimal resilience, in ICDCN (ACM, 2023), pp. 167\u2013176","DOI":"10.1145\/3571306.3571333"},{"key":"9457_CR12","doi-asserted-by":"crossref","unstructured":"A.\u00a0Choudhury, N.\u00a0Pappu, Perfectly-secure asynchronous MPC for general adversaries (extended abstract), in INDOCRYPT, vol. 12578 of Lecture Notes in Computer Science (Springer, 2020), pp. 786\u2013809.","DOI":"10.1007\/978-3-030-65277-7_35"},{"issue":"1","key":"9457_CR13","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"A.\u00a0Choudhury, A.\u00a0Patra, An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9457_CR14","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cohen, Asynchronous secure multiparty computation in constant time, in PKC, vol. 9615 of Lecture Notes in Computer Science (Springer, 2016), pp. 183\u2013207","DOI":"10.1007\/978-3-662-49387-8_8"},{"key":"9457_CR15","doi-asserted-by":"crossref","unstructured":"S.\u00a0Coretti, J.A. Garay, M.\u00a0Hirt, V.\u00a0Zikas, Constant-round asynchronous multi-party computation based on one-way functions, in ASIACRYPT, vol. 10032 of Lecture Notes in Computer Science (2016), pp. 998\u20131021","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"9457_CR16","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, I.\u00a0Damg\u00e5rd, S.\u00a0Dziembowski, M.\u00a0Hirt, T.\u00a0Rabin, Efficient multiparty computations secure against an adaptive adversary, in EUROCRYPT, vol. 1592 of Lecture Notes in Computer Science (Springer, 1999), pp. 311\u2013326","DOI":"10.1007\/3-540-48910-X_22"},{"issue":"2","key":"9457_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"M.J. Fischer, N.A. Lynch, M.\u00a0Paterson, Impossibility of distributed consensus with one faulty process. J. ACM32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"9457_CR18","doi-asserted-by":"crossref","unstructured":"M\u00a0Fitzi, U.M. Maurer, Efficient byzantine agreement secure against general adversaries, in DISC, vol. 1499 of Lecture Notes in Computer Science (Springer, 1998), pp. 134\u2013148","DOI":"10.1007\/BFb0056479"},{"key":"9457_CR19","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, The Foundations of Cryptography-Volume 2, Basic Applications (Cambridge University Press, 2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9457_CR20","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali, A.\u00a0Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in A.V. Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing (ACM, New York, 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9457_CR21","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hirt, J.B. Nielsen, B.\u00a0Przydatek, Cryptographic asynchronous multi-party computation with optimal resilience (extended abstract), in R.\u00a0Cramer, editor, Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings, vol. 3494 of Lecture Notes in Computer Science (Springer, 2005), pp. 322\u2013340","DOI":"10.1007\/11426639_19"},{"key":"9457_CR22","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hirt, J.B. Nielsen, B.\u00a0Przydatek, Asynchronous multi-party computation with quadratic communication, in ICALP, vol. 5126 of Lecture Notes in Computer Science (Springer, 2008), pp. 473\u2013485","DOI":"10.1007\/978-3-540-70583-3_39"},{"issue":"1","key":"9457_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol.13(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"9457_CR24","doi-asserted-by":"crossref","unstructured":"M. Hirt, D. Tschudi, Efficient general-adversary multi-party computation, in ASIACRYPT, vol. 8270 of Lecture Notes in Computer Science (Springer, 2013), pp. 181\u2013200","DOI":"10.1007\/978-3-642-42045-0_10"},{"key":"9457_CR25","unstructured":"M.\u00a0Ito, A.\u00a0Saito, T.\u00a0Nishizeki, Secret sharing schemes realizing general access structures), in Global Telecommunication Conference, Globecom (IEEE Computer Society, 1987), pp. 99\u2013102"},{"key":"9457_CR26","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, U.\u00a0Maurer, B.\u00a0Tackmann, V.\u00a0Zikas, Universally composable synchronous computation, in TCC, vol. 7785 of Lecture Notes in Computer Science (Springer, 2013), pp. 477\u2013498","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"9457_CR27","unstructured":"K.\u00a0Kursawe, F.C. Freiling, Byzantine Fault Tolerance on General Hybrid Adversary Structures. Technical Report (RWTH Aachen, 2005)"},{"key":"9457_CR28","doi-asserted-by":"crossref","unstructured":"U.M. Maurer, Secure multi-party computation made simple, in SCN, vol. 2576 of Lecture Notes in Computer Science (Springer, 2002), pp. 14\u201328","DOI":"10.1007\/3-540-36413-7_2"},{"key":"9457_CR29","doi-asserted-by":"crossref","unstructured":"A.\u00a0Patra, A.\u00a0Choudhury, C.\u00a0Pandu Rangan, Asynchronous byzantine agreement with optimal resilience. Distrib. Comput.27(2), 111\u2013146 (2014)","DOI":"10.1007\/s00446-013-0200-5"},{"issue":"1","key":"9457_CR30","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00145-013-9172-7","volume":"28","author":"A Patra","year":"2015","unstructured":"A.\u00a0Patra, A.\u00a0Choudhury, C.\u00a0Pandu Rangan, Efficient asynchronous verifiable secret sharing and multiparty computation. J. Cryptol.28(1), 49\u2013109 (2015)","journal-title":"J. Cryptol."},{"issue":"2","key":"9457_CR31","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"M. Pease, R. Shostak, L. Lamport, Reaching agreement in the presence of faults. J. ACM (JACM), 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"key":"9457_CR32","doi-asserted-by":"crossref","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority (extended abstract), in STOC (ACM, 1989), pp. 73\u201385","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"9457_CR33","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A.\u00a0Shamir, How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9457_CR34","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Protocols for secure computations (extended abstract), in FOCS (IEEE Computer Society, 1982), pp. 160\u2013164","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09457-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09457-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09457-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:09:15Z","timestamp":1691597355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09457-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,24]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9457"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09457-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,24]]},"assertion":[{"value":"2 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"16"}}