{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T17:49:31Z","timestamp":1776275371111,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T00:00:00Z","timestamp":1477267200000},"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":[[2016,10,24]]},"DOI":"10.1145\/2976749.2978331","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T12:46:35Z","timestamp":1477399595000},"page":"805-817","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":320,"title":["High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority"],"prefix":"10.1145","author":[{"given":"Toshinori","family":"Araki","sequence":"first","affiliation":[{"name":"NEC Corporation, Tokyo, Japan"}]},{"given":"Jun","family":"Furukawa","sequence":"additional","affiliation":[{"name":"NEC Corporation, Tokyo, Japan"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}]},{"given":"Kazuma","family":"Ohara","sequence":"additional","affiliation":[{"name":"NEC Corporation, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","author":"Asharov G.","unstructured":"G. Asharov and Y. Lindell . A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. To appear in phJ.\\ of Cryptology. G. Asharov and Y. Lindell. A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. To appear in phJ.\\ of Cryptology.","journal-title":"To appear in phJ.\\ of Cryptology."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_31"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography -","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich : Foundations of Cryptography - Volume 2 , Basic Applications. Cambridge University Press 2004 O. Goldreich: Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press 2004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813619"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_26"},{"key":"e_1_3_2_1_14_1","volume-title":"Actively Secure OT Extension with Optimal Overhead. In CRYPTO 2015","author":"Keller M.","year":"2015","unstructured":"M. Keller , E. Orsini and P. Scholl . Actively Secure OT Extension with Optimal Overhead. In CRYPTO 2015 , Springer (LNCS 9215), pages 724--741 , 2015 . M. Keller, E. Orsini and P. Scholl. Actively Secure OT Extension with Optimal Overhead. In CRYPTO 2015, Springer (LNCS 9215), pages 724--741, 2015."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53357-4_18"},{"issue":"5","key":"e_1_3_2_1_16_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_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364556"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_6"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626309"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_21_1","volume-title":"Personal comm. -- AES performance on the new Sharemind cluster","year":"2016","unstructured":". Randmets. Personal comm. -- AES performance on the new Sharemind cluster . May , 2016 . . Randmets. Personal comm. -- AES performance on the new Sharemind cluster. May, 2016."},{"key":"e_1_3_2_1_22_1","unstructured":". Talviste.\n  Applying Secure Multi-Party Computation in Practice\n  . Ph.D dissertation Univ. of Tartu 2016\n  .  . Talviste. Applying Secure Multi-Party Computation in Practice. Ph.D dissertation Univ. of Tartu 2016."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_25_1","first-page":"220","volume-title":"EUROCRYPT","author":"Rosulek M.","year":"2015","unstructured":". Zahur, M. Rosulek and D. Evans . Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates . EUROCRYPT , pages 220 -- 250 , 2015 . . Zahur, M. Rosulek and D. Evans.Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. EUROCRYPT, pages 220--250, 2015."},{"key":"e_1_3_2_1_26_1","unstructured":"Sharemind Cybernetica. https:\/\/sharemind.cyber.ee.  Sharemind Cybernetica. https:\/\/sharemind.cyber.ee."}],"event":{"name":"CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security","location":"Vienna Austria","acronym":"CCS'16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978331","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:17Z","timestamp":1750222577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":26,"alternative-id":["10.1145\/2976749.2978331","10.1145\/2976749"],"URL":"https:\/\/doi.org\/10.1145\/2976749.2978331","relation":{},"subject":[],"published":{"date-parts":[[2016,10,24]]},"assertion":[{"value":"2016-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}