{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:23:16Z","timestamp":1790814196522,"version":"4.1.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306167","type":"print"},{"value":"9783031306174","type":"electronic"}],"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-3-031-30617-4_5","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"129-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Minimizing Setup in\u00a0Broadcast-Optimal Two Round MPC"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Divya","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luisa","family":"Siniscalchi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sophia","family":"Yakoubov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Two round information-theoretic MPC with malicious security. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019, Part II. Lecture Notes in Computer Science, vol. 11477, pp. 532\u2013561. Springer, Heidelberg, Germany, Darmstadt, Germany (May 19\u201323, 2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_19","DOI":"10.1007\/978-3-030-17656-3_19"},{"key":"5_CR2","unstructured":"Badrinarayanan, S., Miao, P., Mukherjee, P., Ravi, D.: On the round complexity of fully secure solitary mpc with honest majority. Cryptology ePrint Archive, Report 2021\/241 (2021), https:\/\/eprint.iacr.org\/2021\/241"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Adaptively secure garbling with applications to one-time programs and secure outsourcing. In: Wang, X., Sako, K. (eds.) Advances in Cryptology - ASIACRYPT 2012. Lecture Notes in Computer Science, vol. 7658, pp. 134\u2013153. Springer, Heidelberg, Germany, Beijing, China (Dec 2\u20136, 2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_10","DOI":"10.1007\/978-3-642-34961-4_10"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Lin, H.: k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018, Part II. Lecture Notes in Computer Science, vol. 10821, pp. 500\u2013532. Springer, Heidelberg, Germany, Tel Aviv, Israel (Apr 29 - May 3, 2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_17","DOI":"10.1007\/978-3-319-78375-8_17"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Chen, M., Cohen, R., Doerner, J., Kondi, Y., Lee, E., Rosefield, S., shelat, a.: Multiparty generation of an RSA modulus. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology - CRYPTO 2020, Part III. Lecture Notes in Computer Science, vol. 12172, pp. 64\u201393. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 17\u201321, 2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_3","DOI":"10.1007\/978-3-030-56877-1_3"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: 18th Annual ACM Symposium on Theory of Computing. pp. 364\u2013369. ACM Press, Berkeley, CA, USA (May 28\u201330, 1986). https:\/\/doi.org\/10.1145\/12130.12168","DOI":"10.1145\/12130.12168"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Cohen, R., Garay, J.A., Zikas, V.: Broadcast-optimal two-round MPC. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology - EUROCRYPT 2020, Part II. Lecture Notes in Computer Science, vol. 12106, pp. 828\u2013858. Springer, Heidelberg, Germany, Zagreb, Croatia (May 10\u201314, 2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_28","DOI":"10.1007\/978-3-030-45724-2_28"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. In: Sarkar, P., Iwata, T. (eds.) Advances in Cryptology - ASIACRYPT 2014, Part II. Lecture Notes in Computer Science, vol. 8874, pp. 466\u2013485. Springer, Heidelberg, Germany, Kaoshiung, Taiwan, R.O.C. (Dec 7\u201311, 2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_25","DOI":"10.1007\/978-3-662-45608-8_25"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Magri, B., Ravi, D., Siniscalchi, L., Yakoubov, S.: Broadcast-optimal two round MPC with an honest majority. In: Crypto. pp. 155\u2013184. Lecture Notes in Computer Science, Springer, Heidelberg, Germany (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_6","DOI":"10.1007\/978-3-030-84245-1_6"},{"key":"5_CR10","unstructured":"Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Minimizing setup in broadcast-optimal two round MPC. Cryptology ePrint Archive, Report 2021\/241 (2022), https:\/\/eprint.iacr.org\/2022\/293"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Patra, A.: Broadcast extensions with optimal communication and round complexity. In: Giakkoupis, G. (ed.) 35th ACM Symposium Annual on Principles of Distributed Computing. pp. 371\u2013380. Association for Computing Machinery, Chicago, IL, USA (Jul 25\u201328, 2016). https:\/\/doi.org\/10.1145\/2933057.2933082","DOI":"10.1145\/2933057.2933082"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018, Part II. Lecture Notes in Computer Science, vol. 10821, pp. 468\u2013499. Springer, Heidelberg, Germany, Tel Aviv, Israel (Apr 29 - May 3, 2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_16","DOI":"10.1007\/978-3-319-78375-8_16"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-round secure multiparty computation. In: Yung, M. (ed.) Advances in Cryptology - CRYPTO 2002. Lecture Notes in Computer Science, vol. 2442, pp. 178\u2013193. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 18\u201322, 2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_12","DOI":"10.1007\/3-540-45708-9_12"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Goel, A., Jain, A., Prabhakaran, M., Raghunath, R.: On communication models and best-achievable security in two-round MPC. TCC p. 690 (2021)","DOI":"10.1007\/978-3-030-90453-1_4"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Liu, F.H., Shi, E.: Constant-round MPC with fairness and guarantee of output delivery. In: Gennaro, R., Robshaw, M.J.B. (eds.) Advances in Cryptology - CRYPTO 2015, Part II. Lecture Notes in Computer Science, vol. 9216, pp. 63\u201382. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 16\u201320, 2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_4","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Hirt, M., Raykov, P.: Multi-valued byzantine broadcast: The $$t < n$$ case. In: Sarkar, P., Iwata, T. (eds.) Advances in Cryptology - ASIACRYPT 2014, Part II. Lecture Notes in Computer Science, vol. 8874, pp. 448\u2013465. Springer, Heidelberg, Germany, Kaoshiung, Taiwan, R.O.C. (Dec 7\u201311, 2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_24","DOI":"10.1007\/978-3-662-45608-8_24"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kumaresan, R., Kushilevitz, E., Paskin-Cherniavsky, A.: Secure computation with minimal interaction, revisited. In: Gennaro, R., Robshaw, M.J.B. (eds.) Advances in Cryptology - CRYPTO 2015, Part II. Lecture Notes in Computer Science, vol. 9216, pp. 359\u2013378. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 16\u201320, 2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_18","DOI":"10.1007\/978-3-662-48000-7_18"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Paskin, A.: Secure multiparty computation with minimal interaction. In: Rabin, T. (ed.) Advances in Cryptology - CRYPTO 2010. Lecture Notes in Computer Science, vol. 6223, pp. 577\u2013594. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 15\u201319, 2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_31","DOI":"10.1007\/978-3-642-14623-7_31"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Patra, A., Ravi, D.: On the exact round complexity of secure three-party computation. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology - CRYPTO 2018, Part II. Lecture Notes in Computer Science, vol. 10992, pp. 425\u2013458. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 19\u201323, 2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_15","DOI":"10.1007\/978-3-319-96881-0_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30617-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:02:53Z","timestamp":1744754573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30617-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306167","9783031306174"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30617-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.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":"415","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":"109","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":"26% - 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":"16","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)"}}]}}