{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:55:04Z","timestamp":1777733704034,"version":"3.51.4"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,12,17]],"date-time":"2020-12-17T00:00:00Z","timestamp":1608163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>MPC has moved from theoretical study to real-world usage. How is it doing?<\/jats:p>","DOI":"10.1145\/3387108","type":"journal-article","created":{"date-parts":[[2020,12,17]],"date-time":"2020-12-17T23:39:35Z","timestamp":1608248375000},"page":"86-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":225,"title":["Secure multiparty computation"],"prefix":"10.1145","volume":"64","author":[{"given":"Yehuda","family":"Lindell","sequence":"first","affiliation":[{"name":"Bar Ilan University, Ramat Gan, Israel"}]}],"member":"320","published-online":{"date-parts":[[2020,12,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9040-7"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_2_1_6_1","volume-title":"Universally composable security: A new paradigm for cryptographic protocols. In the 42nd FOCS","author":"Canetti R.","year":"2001","unstructured":"Canetti , R. Universally composable security: A new paradigm for cryptographic protocols. In the 42nd FOCS ( 2001 ), 136--145. Canetti, R. Universally composable security: A new paradigm for cryptographic protocols. In the 42nd FOCS (2001), 136--145."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_38"},{"key":"e_1_2_1_8_1","volume-title":"Universally composable two-party and multi-party computation. In the 34th STOC","author":"Canetti R.","year":"2002","unstructured":"Canetti , R. , Lindell , Y. , Ostrovsky , R. , Sahai , A. Universally composable two-party and multi-party computation. In the 34th STOC ( 2002 ), 494--503. http:\/\/eprint.iacr.org\/2002\/140. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A. Universally composable two-party and multi-party computation. In the 34th STOC (2002), 494--503. http:\/\/eprint.iacr.org\/2002\/140."},{"key":"e_1_2_1_9_1","volume-title":"Multi-party unconditionally secure protocols. In the 20th STOC","author":"Chaum D.","year":"1988","unstructured":"Chaum , D. , Cr\u00e9peau , C. , Damg\u00e5rd , I. Multi-party unconditionally secure protocols. In the 20th STOC ( 1988 ), 11--19. Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I. Multi-party unconditionally secure protocols. In the 20th STOC (1988), 11--19."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"e_1_2_1_11_1","volume-title":"Limits on the security of coin flips when half the processors are faulty. In the 18th STOC","author":"Cleve R.","year":"1986","unstructured":"Cleve , R. Limits on the security of coin flips when half the processors are faulty. In the 18th STOC ( 1986 ), 364--369. Cleve, R. Limits on the security of coin flips when half the processors are faulty. In the 18th STOC (1986), 364--369."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00024"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835090"},{"key":"e_1_2_1_16_1","volume-title":"Two-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest. In the 26th ACM CCS","author":"Furukawa J.","year":"2019","unstructured":"Furukawa , J. , Lindell , Y. Two-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest. In the 26th ACM CCS ( 2019 ), 1557--1571. Furukawa, J., Lindell, Y. Two-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest. In the 26th ACM CCS (2019), 1557--1571."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243859"},{"key":"e_1_2_1_18_1","volume-title":"How to play any mental game -- A completeness theorem for protocols with honest majority. In the 19th STOC","author":"Goldreich O.","year":"1987","unstructured":"Goldreich , O. , Micali , S. , Wigderson , A. How to play any mental game -- A completeness theorem for protocols with honest majority. In the 19th STOC ( 1987 ), O. Goldreich, ed. Volume 2 of Foundations of Cryptography -- Basic Applications (2004), Cambridge University Press , 218--229. Goldreich, O., Micali, S., Wigderson, A. How to play any mental game -- A completeness theorem for protocols with honest majority. In the 19th STOC (1987), O. Goldreich, ed. Volume 2 of Foundations of Cryptography -- Basic Applications (2004), Cambridge University Press, 218--229."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00028"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_2_1_23_1","volume-title":"Efficient batched oblivious PRF with applications to private set intersection. In the 23rd ACM CCS","author":"Kolesnikov V.","year":"2016","unstructured":"Kolesnikov , V. , Kumaresan , R. , Rosulek , M. , Trieu , N. Efficient batched oblivious PRF with applications to private set intersection. In the 23rd ACM CCS ( 2016 ), 818--829. Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N. Efficient batched oblivious PRF with applications to private set intersection. In the 23rd ACM CCS (2016), 818--829."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209811.3212701"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"e_1_2_1_27_1","volume-title":"the 25th ACM CCS (2018)","author":"Lindell Y.","unstructured":"Lindell , Y. , Nof , A. Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody . In the 25th ACM CCS (2018) , 1837--1854. Lindell, Y., Nof, A. Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In the 25th ACM CCS (2018), 1837--1854."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"e_1_2_1_30_1","volume-title":"10th PODC","author":"Ostrovsky R.","year":"1991","unstructured":"Ostrovsky , R. , Yung , M. How to withstand mobile virus attacks . In 10th PODC ( 1991 ), 51--59. Ostrovsky, R., Yung, M. How to withstand mobile virus attacks. In 10th PODC (1991), 51--59."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_2_1_32_1","first-page":"7","article-title":"Scalable private set intersection based on OT extension","volume":"21","author":"Pinkas B.","year":"2018","unstructured":"Pinkas , B. , Schneider , T. , Zohner , M . Scalable private set intersection based on OT extension . ACM T. Privacy Sec. 21 , 2: 7 ( 2018 ), 1--35. Pinkas, B., Schneider, T., Zohner, M. Scalable private set intersection based on OT extension. ACM T. Privacy Sec. 21, 2:7 (2018), 1--35.","journal-title":"ACM T. Privacy Sec."},{"key":"e_1_2_1_33_1","volume-title":"Verifiable secret sharing and multi-party protocols with honest majority. In the 21st STOC","author":"Rabin T.","year":"1989","unstructured":"Rabin , T. , Ben-Or , M. Verifiable secret sharing and multi-party protocols with honest majority. In the 21st STOC ( 1989 ), 73--85. Rabin, T., Ben-Or, M. Verifiable secret sharing and multi-party protocols with honest majority. In the 21st STOC (1989), 73--85."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_35_1","volume-title":"EUROCRYPT 2000 (2000","author":"Shoup V.","year":"1807","unstructured":"Shoup , V. Practical threshold signatures . In EUROCRYPT 2000 (2000 ), Springer (LNCS 1807 ), 207--220. Shoup, V. Practical threshold signatures. In EUROCRYPT 2000 (2000), Springer (LNCS 1807), 207--220."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352489"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_2_1_38_1","unstructured":"Unbound Tech. (www.unboundtech.com) Sepior (sepior.com) and Curv (www.curv.co).  Unbound Tech. (www.unboundtech.com) Sepior (sepior.com) and Curv (www.curv.co)."},{"key":"e_1_2_1_39_1","unstructured":"Sharemind https:\/\/sharemind.cyber.ee.  Sharemind https:\/\/sharemind.cyber.ee."},{"key":"e_1_2_1_40_1","unstructured":"Duality https:\/\/duality.cloud.  Duality https:\/\/duality.cloud."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3387108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:26Z","timestamp":1750199606000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,17]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1145\/3387108"],"URL":"https:\/\/doi.org\/10.1145\/3387108","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,17]]},"assertion":[{"value":"2020-12-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}