{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:52:44Z","timestamp":1742989964056,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562341"},{"type":"electronic","value":"9783031562358"}],"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-56235-8_1","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:02:34Z","timestamp":1711634554000},"page":"3-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Threshold-Optimal MPC with\u00a0Friends and\u00a0Foes"],"prefix":"10.1007","author":[{"given":"Nikolas","family":"Melissaris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divya","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophia","family":"Yakoubov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Alon, B., Omri, E., Paskin-Cherniavsky, A.: MPC with friends and foes. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2020. CRYPTO 2020. LNCS, vol. 12171, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_24","DOI":"10.1007\/978-3-030-56880-1_24"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2012. EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) Advances in Cryptology \u2013 CRYPTO \u201991. CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1\u201310. ACM Press, May 1988. https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018. CRYPTO 2018. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press, May 2002. https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"1_CR7","unstructured":"Dalskov, A.P.K., Escudero, D., Keller, M.: Fantastic four: Honest-majority four-party secure computation with malicious security. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 2183\u20132200. USENIX Association, August 2021"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Adaptive versus static security in the UC model. In: Chow, S.S.M., Liu, J.K., Hui, L.C.K., Yiu, S.M. (eds.) Provable Security. ProvSec 2014. LNCS, vol. 8782, pp. 10\u201328. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12475-9_2","DOI":"10.1007\/978-3-319-12475-9_2"},{"key":"1_CR9","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 \u2013 CRYPTO 2002. CRYPTO 2002. LNCS, vol. 2442, pp. 178\u2013193. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_12","DOI":"10.1007\/3-540-45708-9_12"},{"key":"1_CR10","doi-asserted-by":"publisher","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. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press, May 1987. https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"1_CR11","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. (eds.) Advances in Cryptology \u2013 CRYPTO 2015. CRYPTO 2015. LNCS, vol. 9216, pp. 63\u201382. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_4","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Hegde, A., Koti, N., Kukkala, V.B., Patil, S., Patra, A., Paul, P.: Attaining GOD beyond honest majority with friends and foes. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022. ASIACRYPT 2022. LNCS, vol. 13791, pp. 556\u2013587. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_19","DOI":"10.1007\/978-3-031-22963-3_19"},{"key":"1_CR13","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. (eds.) Advances in Cryptology \u2013 CRYPTO 2015. CRYPTO 2015. LNCS, vol. 9216, pp. 359\u2013378. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_18","DOI":"10.1007\/978-3-662-48000-7_18"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: On combining privacy with guaranteed output delivery in secure multiparty computation. In: Dwork, C. (ed.) Advances in Cryptology \u2013 CRYPTO 2006. CRYPTO 2006. LNCS, vol. 4117, pp. 483\u2013500. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_29","DOI":"10.1007\/11818175_29"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Paskin, A.: Secure multiparty computation with minimal interaction. In: Rabin, T. (ed.) Advances in Cryptology \u2013 CRYPTO 2010. CRYPTO 2010. LNCS, vol. 6223, pp. 577\u2013594. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_31","DOI":"10.1007\/978-3-642-14623-7_31"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Katz, J.: On achieving the best of both worlds in secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 11\u201320. ACM Press, June 2007. https:\/\/doi.org\/10.1145\/1250790.1250793","DOI":"10.1145\/1250790.1250793"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Koti, N., Kukkala, V.B., Patra, A., Gopal, B.R.: PentaGOD: stepping beyond traditional GOD with five parties. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 1843\u20131856. ACM Press, November 2022. https:\/\/doi.org\/10.1145\/3548606.3559369","DOI":"10.1145\/3548606.3559369"},{"key":"1_CR18","unstructured":"Koti, N., Pancholi, M., Patra, A., Suresh, A.: SWIFT: super-fast and robust privacy-preserving machine learning. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 2651\u20132668. USENIX Association, August 2021"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Koti, N., Patra, A., Rachuri, R., Suresh, A.: Tetrad: Actively secure 4PC for secure training and inference. Cryptology ePrint Archive, Report 2021\/755 (2021). https:\/\/eprint.iacr.org\/2021\/755","DOI":"10.14722\/ndss.2022.24058"},{"key":"1_CR20","unstructured":"Melissaris, N., Ravi, D., Yakoubov, S.: Threshold-optimal MPC with friends and foes. Cryptology ePrint Archive, Paper 2022\/1526 (2022). https:\/\/eprint.iacr.org\/2022\/1526"},{"key":"1_CR21","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 \u2013 CRYPTO 2018. CRYPTO 2018. LNCS, vol. 10992, pp. 425\u2013458. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_15","DOI":"10.1007\/978-3-319-96881-0_15"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press, October 1986. https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56235-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:03:45Z","timestamp":1711634625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56235-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562341","9783031562358"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56235-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2023","order":10,"name":"conference_id","label":"Conference ID","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","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":"27","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":"36% - 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":"4","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)"}}]}}