{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:12:12Z","timestamp":1783008732045,"version":"3.54.5"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683961","type":"print"},{"value":"9783031683978","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68397-8_13","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"418-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Linear-Communication Asynchronous Complete Secret Sharing with\u00a0Optimal Resilience"],"prefix":"10.1007","author":[{"given":"Xiaoyu","family":"Ji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junru","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"13_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 - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part I, vol. 13747 of Lecture Notes in Computer Science, pp. 384\u2013414. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_14","DOI":"10.1007\/978-3-031-22318-1_14"},{"key":"13_CR2","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":"13_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-022-09434-2","volume":"35","author":"I Abraham","year":"2022","unstructured":"Abraham, I., Asharov, G., Yanai, A.: Efficient perfectly secure computation with optimal resilience. J. Cryptol. 35(4), 27 (2022)","journal-title":"J. Cryptol."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Stern, G.: Revisiting asynchronous fault tolerant computation with optimal resilience. In: Proceedings of the 39th Symposium on Principles of Distributed Computing PODC \u201920, pp. 139\u2013148, New York, NY, USA (2020). Association for Computing Machinery","DOI":"10.1145\/3382734.3405722"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G.: Bingo: adaptivity and asynchrony in verifiable secret sharing and distributed key generation. In: Handschuh, H., Lysyanskaya, A., eds, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, vol. 14081 of Lecture Notes in Computer Science pp. 39\u201370. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_2","DOI":"10.1007\/978-3-031-38557-5_2"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of statistical MPC with optimal resiliency. In: Saha, B., Servedio, R.A., eds, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 1527\u20131536. ACM (2023)","DOI":"10.1145\/3564246.3585228"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Rao Kosaraju, S., David\u00a0S. Johnson, Aggarwal, A., eds, Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA pp. 52\u201361. ACM (1993)","DOI":"10.1145\/167088.167109"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32009-5_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"E Ben-Sasson","year":"2012","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 663\u2013680. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_39"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Janos Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"13_CR11","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":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Anderson, J.H., Peleg, D., Borowsky, E., eds, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994, pp. 183\u2013192. ACM (1994)","DOI":"10.1145\/197917.198088"},{"key":"13_CR14","doi-asserted-by":"crossref","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, New York, NY, USA (1993). Association for Computing Machinery","DOI":"10.1145\/167088.167109"},{"key":"13_CR15","doi-asserted-by":"crossref","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, New York, NY, USA (1994). Association for Computing Machinery","DOI":"10.1145\/197917.198088"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Bracha, X.: An asynchronou [(n-1)\/3]-resilient consensus protocol. In: Kameda, T., Misra, J., Peters, J.P., Santoro, N., eds, Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984, pp. 154\u2013162. ACM (1984)","DOI":"10.1145\/800222.806743"},{"key":"13_CR17","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Sci. Counc. Weizmann Inst. Sci. (1996)"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM, 67(5), 1\u201394 (2020)","DOI":"10.1145\/3402457"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Simon, J., eds, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 11\u201319. ACM (1988)","DOI":"10.1145\/62212.62214"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Cohen, R., Forghani, P., Garay, J.A., Patel, R., Zikas, V.: Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited. In: Rothblum, G.N., Wee, H., eds, Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV, vol. 14372 of Lecture Notes in Computer Science, pp. 422\u2013451. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_16","DOI":"10.1007\/978-3-031-48624-1_16"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Coretti, S., Garay, J.A., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: Cheon, J.H., Takagi, T., eds, Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, vol. 10032 of Lecture Notes in Computer Science, pp. 998\u20131021 (2016)","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Choudhury, A., Hirt, M., Patra, A.: Asynchronous multiparty computation with linear communication complexity. In: Afek, Y., eds, Distributed Computing - 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings, vol. 8205 of Lecture Notes in Computer Science, pp. 388\u2013402. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-41527-2_27","DOI":"10.1007\/978-3-642-41527-2_27"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Cohen, R.: Asynchronous secure multiparty computation in constant time. In: Cheng, C.H., Chung, K.M., Persiano, G., Yang, B.Y., eds, Public-Key Cryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part II, vol. 9615 of Lecture Notes in Computer Science, pp. 183\u2013207. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_8","DOI":"10.1007\/978-3-662-49387-8_8"},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory 63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"13_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00145-023-09451-9","volume":"36","author":"A Choudhury","year":"2023","unstructured":"Choudhury, A., Patra, A.: On the communication efficiency of statistically secure asynchronous MPC with optimal resilience. J. Cryptol. 36(2), 13 (2023)","journal-title":"J. Cryptol."},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: Kosaraju, S.R., Johnson, D.S., Aggarwal, A., eds, Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 42\u201351. ACM (1993)","DOI":"10.1145\/167088.167105"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y.: Turbopack: honest majority MPC with constant online communication. In: Yin, H., Stavrou, A., Cremers, C., Shi, E., eds, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pp. 951\u2013964. ACM (2022)","DOI":"10.1145\/3548606.3560633"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Goyal, V., Liu-Zhang, C.D., Song, Y.: Towards achieving asynchronous MPC with linear communication and optimal resilience. IACR Cryptol. ePrint Archive, 243 (2024)","DOI":"10.1007\/978-3-031-68397-8_6"},{"key":"13_CR32","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: Aho, A.V., eds, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"13_CR33","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"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-14496-7_7","volume-title":"Information Theoretic Security","author":"A Patra","year":"2010","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 74\u201392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_7"},{"key":"13_CR35","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":"13_CR36","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Johnson, D.S., editor, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"13_CR37","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44495-5_11","volume-title":"Progress in Cryptology \u2014INDOCRYPT 2000","author":"K Srinathan","year":"2000","unstructured":"Srinathan, K., Pandu Rangan, C.: Efficient asynchronous secure multiparty distributed computation. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 117\u2013129. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44495-5_11"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Victor Shoup and Nigel\u00a0P. Smart. Lightweight asynchronous verifiable secret sharing with optimal resilience. IACR Cryptol. ePrint Archive, 536 (2023). https:\/\/doi.org\/10.1007\/s00145-024-09505-6","DOI":"10.1007\/s00145-024-09505-6"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, pp. 80\u201391. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68397-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:25:11Z","timestamp":1732649111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}