{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:22:55Z","timestamp":1779934975165,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["615172"],"award-info":[{"award-number":["615172"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3339811","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"1557-1571","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest"],"prefix":"10.1145","author":[{"given":"Jun","family":"Furukawa","sequence":"first","affiliation":[{"name":"NEC Israel Research Center, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[{"name":"Bar-Ilan University & Unbound Tech, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. In the IEEE S&P","author":"Araki T.","year":"2017","unstructured":"T. Araki , A. Barak , J. Furukawa , T. Lichter , Y. Lindell , A. Nof , K. Ohara , A. Watzman and O. Weinstein . Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. In the IEEE S&P , 2017 . T. Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzman and O. Weinstein. Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. In the IEEE S&P, 2017."},{"key":"e_1_3_2_2_2_1","first-page":"695","volume-title":"An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. In the $25$th ACM CCS","author":"Barak A.","year":"2018","unstructured":"A. Barak , M. Hirt , L. Koskas and Y. Lindell . An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. In the $25$th ACM CCS , pages 695 - 712 , 2018 . A. Barak, M. Hirt, L. Koskas and Y. Lindell.An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. In the $25$th ACM CCS, pages 695-712, 2018."},{"key":"e_1_3_2_2_3_1","first-page":"213","volume-title":"Perfectly-secure MPC with linear communication complexity.In TCC","author":"Beerliov\u00e1-Trubiniov\u00e1 Z.","year":"2008","unstructured":"Z. Beerliov\u00e1-Trubiniov\u00e1 and M. Hirt . Perfectly-secure MPC with linear communication complexity.In TCC 2008 , Springer (LNCS 4948), pages 213 -- 230 , 2008. Z. Beerliov\u00e1-Trubiniov\u00e1 and M. Hirt. Perfectly-secure MPC with linear communication complexity.In TCC 2008, Springer (LNCS 4948), pages 213--230, 2008."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_2_7_1","first-page":"11","volume-title":"Multi-party Unconditionally Secure Protocols. In 20th STOC","author":"Cr\u00e9peau C.","year":"1988","unstructured":". Chaum, C. Cr\u00e9peau and I. Damg\u00e5 rd . Multi-party Unconditionally Secure Protocols. In 20th STOC , pages 11 -- 19 , 1988 . . Chaum, C. Cr\u00e9peau and I. Damg\u00e5 rd. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11--19, 1988."},{"key":"e_1_3_2_2_8_1","volume-title":"Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO 2018","author":"Chida K.","year":"2018","unstructured":"K. Chida , D. Genkin , K. Hamada , D. Ikarashi , R. Kikuchi , Y. Lindell and A. Nof . Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO 2018 , Springer (LNCS 10993), pages 34--64 , 2018 . K. Chida, D. Genkin, K. Hamada, D. Ikarashi, R. Kikuchi, Y. Lindell and A. Nof. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO 2018, Springer (LNCS 10993), pages 34--64, 2018."},{"key":"e_1_3_2_2_9_1","first-page":"342","volume-title":"Share Conversion, Pseudo random Secret-Sharing and Applications to Secure Computation. In TCC","author":"Cramer R.","year":"2005","unstructured":"R. Cramer , I. Damg\u00e5 rd and Y. Ishai , Share Conversion, Pseudo random Secret-Sharing and Applications to Secure Computation. In TCC , Springer (LNCS 3378) pages 342 -- 362 , 2005 . R. Cramer, I. Damg\u00e5 rd and Y. Ishai, Share Conversion, Pseudo random Secret-Sharing and Applications to Secure Computation. In TCC, Springer (LNCS 3378) pages 342--362, 2005."},{"key":"e_1_3_2_2_10_1","volume-title":"CRYPTO 2007","author":"Nielsen I.","year":"2007","unstructured":"I. Damg\u00e5 rd and J. Nielsen . Scalable and unconditionally secure multiparty computation . In CRYPTO 2007 , Springer (LNCS 4622), pages 572--590 , 2007 . I. Damg\u00e5 rd and J. Nielsen. Scalable and unconditionally secure multiparty computation. In CRYPTO 2007, Springer (LNCS 4622), pages 572--590, 2007."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835090"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591861"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/975541"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0319-z"},{"issue":"5","key":"e_1_3_2_2_18_1","first-page":"2090","volume":"39","author":"Kushilevitz E.","year":"2010","unstructured":"E. Kushilevitz , Y. Lindell and T. Rabin . Information-Theoretically Secure Protocols and Security Under Composition. In the SIAM Journal on Computing , 39 ( 5 ): 2090 -- 2112 , 2010 . E. Kushilevitz, Y. Lindell and T. Rabin. Information-Theoretically Secure Protocols and Security Under Composition. In the SIAM Journal on Computing, 39(5):2090--2112, 2010.","journal-title":"Information-Theoretically Secure Protocols and Security Under Composition. In the SIAM Journal on Computing"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133999"},{"key":"e_1_3_2_2_20_1","volume-title":"Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. In the 8th TCC","author":"Pinkas B.","year":"2011","unstructured":". Lindell and B. Pinkas . Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. In the 8th TCC , Springer (LNCS 6597), 329--346, 2011 . . Lindell and B. Pinkas. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. In the 8th TCC, Springer (LNCS 6597), 329--346, 2011."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93387-0_17"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_2_24_1","first-page":"612","volume-title":"How to share a secret. CACM, 22(11)","author":"Shamir A.","year":"1979","unstructured":"A. Shamir . How to share a secret. CACM, 22(11) , pages 612 -- 613 , 1979 . A. Shamir. How to share a secret. CACM, 22(11), pages 612--613, 1979."},{"key":"e_1_3_2_2_25_1","first-page":"162","volume-title":"How to Generate and Exchange Secrets. $27$th FOCS","year":"1986","unstructured":". Yao. How to Generate and Exchange Secrets. $27$th FOCS , pages 162 -- 167 , 1986 . . Yao. How to Generate and Exchange Secrets. $27$th FOCS, pages 162--167, 1986."}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3339811","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3339811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:01Z","timestamp":1750202641000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3339811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":25,"alternative-id":["10.1145\/3319535.3339811","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3339811","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}