{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:04:14Z","timestamp":1765933454842,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819987207"},{"type":"electronic","value":"9789819987214"}],"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-981-99-8721-4_6","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:01:44Z","timestamp":1702789304000},"page":"172-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MPC with\u00a0Delayed Parties over\u00a0Star-Like Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2759-043X","authenticated-orcid":false,"given":"Mariana","family":"Gama","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3352-6968","authenticated-orcid":false,"given":"Emad Heydari","family":"Beni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1917-1833","authenticated-orcid":false,"given":"Emmanuela","family":"Orsini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9714-928X","authenticated-orcid":false,"given":"Oliver","family":"Zajonc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Acharya, A., Hazay, C., Kolesnikov, V., Prabhakaran, M.: SCALES - MPC with small clients and larger ephemeral servers. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022: 20th Theory of Cryptography Conference, Part II. LNCS, vol. 13748, pp. 502\u2013531. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_18","DOI":"10.1007\/978-3-031-22365-5_18"},{"key":"6_CR2","unstructured":"Alon, B., Naor, M., Omri, E., Stemmer, U.: MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably. Cryptology ePrint Archive, Report 2022\/902 (2022). https:\/\/eprint.iacr.org\/2022\/902"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-030-64840-4_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"S Badrinarayanan","year":"2020","unstructured":"Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: Secure MPC: laziness leads to GOD. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 120\u2013150. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_5"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-90453-1_5","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Boyle, E., Gilboa, N., Halevi, S., Ishai, Y., Nof, A.: Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 129\u2013161. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_5"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-26954-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of key-exchange protocols and their use for building secure channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 453\u2013474. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_28"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-96878-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"K Chida","year":"2018","unstructured":"Chida, K., et al.: Fast large-scale honest-majority MPC for malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 34\u201364. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_2"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84245-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Choudhuri","year":"2021","unstructured":"Choudhuri, A.R., Goel, A., Green, M., Jain, A., Kaptchuk, G.: Fluid MPC: secure multiparty computation with dynamic participants. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 94\u2013123. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_4"},{"key":"6_CR9","unstructured":"Damg\u00e5rd, I., Escudero, D., Polychroniadou, A.: Phoenix: secure computation in an unstable network with dropouts and comebacks. Cryptology ePrint Archive, Report 2021\/1376 (2021). https:\/\/eprint.iacr.org\/2021\/1376"},{"key":"6_CR10","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":"6_CR11","doi-asserted-by":"publisher","unstructured":"Dolev, D., Yao, A.C.C.: On the security of public key protocols (extended abstract). In: 22nd Annual Symposium on Foundations of Computer Science, pp. 350\u2013357. IEEE Computer Society Press, Nashville, TN, USA, 28\u201330 October 1981. https:\/\/doi.org\/10.1109\/SFCS.1981.32","DOI":"10.1109\/SFCS.1981.32"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0055724","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"M Fitzi","year":"1998","unstructured":"Fitzi, M., Hirt, M., Maurer, U.: Trading correctness for privacy in unconditional multi-party computation. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 121\u2013136. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055724"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Furukawa, J., Lindell, Y.: Two-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 1557\u20131571. ACM Press, London, UK, 11\u201315 November 2019. https:\/\/doi.org\/10.1145\/3319535.3339811","DOI":"10.1145\/3319535.3339811"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, pp. 495\u2013504. ACM Press, New York, NY, USA, 31 May\u20133 June 2014. https:\/\/doi.org\/10.1145\/2591796.2591861","DOI":"10.1145\/2591796.2591861"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84245-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Gentry","year":"2021","unstructured":"Gentry, C., et al.: YOSO: you only speak once. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-84245-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in\u00a0the honest majority setting. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 244\u2013274. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9"},{"key":"6_CR17","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. LNCS, vol. 11693, pp. 85\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_4"},{"key":"6_CR18","unstructured":"Goyal, V., Song, Y.: Malicious security comes free in honest-majority MPC. Cryptology ePrint Archive, Report 2020\/134 (2020). https:\/\/eprint.iacr.org\/2020\/134"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-56880-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"V Goyal","year":"2020","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 618\u2013646. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-36413-7_2","volume-title":"Security in Communication Networks","author":"U Maurer","year":"2003","unstructured":"Maurer, U.: Secure multi-party computation made simple. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 14\u201328. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_2"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"UM Maurer","year":"2006","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. Discret. Appl. Math. 154(2), 370\u2013381 (2006). https:\/\/doi.org\/10.1016\/j.dam.2005.03.020","journal-title":"Discret. Appl. Math."},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 719\u2013749. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"6_CR23","unstructured":"ZenGo: White-city: a framework for massive MPC with partial synchrony and partially authenticated channels (2020). https:\/\/github.com\/ZenGo-X\/white-city\/blob\/master\/White-City-Report\/whitecity_new.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8721-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:14Z","timestamp":1765933334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8721-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987207","9789819987214"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8721-4_6","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":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"375","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":"106","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":"28% - 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":"12","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"}]}}