{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T06:32:20Z","timestamp":1772346740327,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["615172"],"award-info":[{"award-number":["615172"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3133999","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"259-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority"],"prefix":"10.1145","author":[{"given":"Yehuda","family":"Lindell","sequence":"first","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.15"},{"key":"e_1_3_2_2_2_1","volume-title":"May","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. Personal communication, May 2017."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_8_1","volume-title":"High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. ePrint Cryptology Archive","author":"Burra S.S.","year":"2015","unstructured":"S.S. Burra, E. Larraia, J.B. Nielsen, P.S. Nordholt, C. Orlandi, E. Orsini, P. Scholl, and N.P. Smart. High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. ePrint Cryptology Archive, 2015\/472."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_2_11_1","first-page":"11","volume-title":"Multi-party Unconditionally Secure Protocols. In 20th STOC","author":"Chaum D.","year":"1988","unstructured":"D. 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_12_1","volume-title":"Actively Private and Correct MPC Scheme in t<n\/2 from Passively Secure Schemes with Small Overhead. IACR Cryptology ePrint Archive, report 2014\/304","author":"Chida K.","year":"2014","unstructured":"K. Chida, K. Hamada, D. Ikarashi and R. Kikuchi. Actively Private and Correct MPC Scheme in t<n\/2 from Passively Secure Schemes with Small Overhead. IACR Cryptology ePrint Archive, report 2014\/304, 2014."},{"key":"e_1_3_2_2_13_1","first-page":"342","volume-title":"Share Conversion, PseudorandomSecret-Sharing and Applications to Secure Computation. In the 2nd TCC","author":"Cramer R.","year":"2005","unstructured":"R. Cramer, I. Damg\u00e5 rd and Y. Ishai, Share Conversion, PseudorandomSecret-Sharing and Applications to Secure Computation. In the 2nd TCC, Springer (LNCS 3378) pages 342--362, 2005."},{"key":"e_1_3_2_2_14_1","first-page":"160","volume-title":"Public Key Cryptography","author":"I.","year":"2009","unstructured":"I. Damg\u00e5 rd, M. Geisler, M. Kr\u00f8 igaard and J.B. Nielsen. Asynchronous Multiparty Computation: Theory and Implementation. In Public Key Cryptography 2009, Springer (LNCS 5443), pages 160--179, 2009."},{"key":"e_1_3_2_2_15_1","volume-title":"Scalable Secure Multiparty Computation. In CRYPTO 2006","author":"Ishai I.","year":"2006","unstructured":"I. Damg\u00e5 rd and Y. Ishai. Scalable Secure Multiparty Computation. In CRYPTO 2006, Springer (LNCS 4117), pages 501--520, 2006."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_2_17_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."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_2_19_1","first-page":"225","volume-title":"High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityIn EUROCRYPT","author":"Furukawa J.","year":"2017","unstructured":"J. Furukawa, Y. Lindell, A. Nof and O. Weinstein. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityIn EUROCRYPT 2017, Springer (LNCS 10211), pages 225--255, 2017."},{"key":"e_1_3_2_2_20_1","first-page":"26","volume-title":"Statistical Tables for Biological, Agricultural and Medical Research","author":"Fisher R.A.","year":"1938","unstructured":"R.A. Fisher and F. Yates. Statistical Tables for Biological, Agricultural and Medical Research (3rd ed.), pages 26--27, 1938.","edition":"3"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591861"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_28"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0319-z"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/090755886"},{"key":"e_1_3_2_2_30_1","volume-title":"Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. In the 8th TCC","author":"Lindell Y.","year":"2011","unstructured":"Y. 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_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813705"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3133999","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3133999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:26Z","timestamp":1750212806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3133999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":36,"alternative-id":["10.1145\/3133956.3133999","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3133999","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}