{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:31:10Z","timestamp":1776940270208,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"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":"Israel Science Foundation","award":["544\/13"],"award-info":[{"award-number":["544\/13"]}]},{"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.2978347","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T12:46:35Z","timestamp":1477399595000},"page":"578-590","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":66,"title":["Optimizing Semi-Honest Secure Multiparty Computation for the Internet"],"prefix":"10.1145","author":[{"given":"Aner","family":"Ben-Efraim","sequence":"first","affiliation":[{"name":"Ben-Gurion University, Beer Sheva, Israel"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[{"name":"Ariel University, Ariel, Israel"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Cyber-defense technology experimental research laboratory (in cooperation with DETER lab). https:\/\/www.create.iucc.ac.il.  Cyber-defense technology experimental research laboratory (in cooperation with DETER lab). https:\/\/www.create.iucc.ac.il."},{"key":"e_1_3_2_1_2_1","unstructured":"CAPI -- the Secure Computation API. https:\/\/github.com\/cryptobiu\/libscapi.  CAPI -- the Secure Computation API. https:\/\/github.com\/cryptobiu\/libscapi."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.04.011"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813619"},{"key":"e_1_3_2_1_18_1","volume-title":"the USENIX Security Symposium","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , D. Evans , J. Katz , and L. Malka . Faster secure two-party computation using garbled circuits . In the USENIX Security Symposium , 2011 . Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In the USENIX Security Symposium, 2011."},{"key":"e_1_3_2_1_19_1","first-page":"294","volume-title":"Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In the $41$st FOCS","author":"Ishai Y.","year":"2000","unstructured":"Y. Ishai and E. Kushilevitz . Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In the $41$st FOCS , pages 294 -- 304 , 2000 . Y. Ishai and E. Kushilevitz. Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In the $41$st FOCS, pages 294--304, 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516744"},{"key":"e_1_3_2_1_24_1","volume-title":"Kumaresan:Improved OT Extension for Transferring Short Secrets. In CRYPTO 2013","author":"Kolesnikov V.","year":"2013","unstructured":"V. Kolesnikov and R. Kumaresan:Improved OT Extension for Transferring Short Secrets. In CRYPTO 2013 , Springer (LNCS 8403), pages 54--70 , 2013 . V. Kolesnikov and R. Kumaresan:Improved OT Extension for Transferring Short Secrets. In CRYPTO 2013, Springer (LNCS 8403), pages 54--70, 2013."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_26_1","first-page":"285","volume-title":"USENIX Security Symposium","author":"Kreuter B.","year":"2012","unstructured":"B. Kreuter , a. shelat, and C. Shen . Billion-gate secure computation with malicious adversaries . In USENIX Security Symposium , pages 285 -- 300 , 2012 . B. Kreuter, a. shelat, and C. Shen. Billion-gate secure computation with malicious adversaries. In USENIX Security Symposium, pages 285--300, 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_28"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_16"},{"key":"e_1_3_2_1_29_1","volume-title":"the USENIX Security Symposium","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas and Y. Sella . Fairplay-secure two-party computation system . In the USENIX Security Symposium , 2004 . D. Malkhi, N. Nisan, B. Pinkas and Y. Sella. Fairplay-secure two-party computation system. In the USENIX Security Symposium, 2004."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813705"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_33_1","volume-title":"EUROCRYPT, 220--250","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 . In EUROCRYPT, 220--250 , 2015 . . Zahur, M. Rosulek and D. Evans:Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. In EUROCRYPT, 220--250, 2015."}],"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.2978347","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:40:14Z","timestamp":1750218014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":33,"alternative-id":["10.1145\/2976749.2978347","10.1145\/2976749"],"URL":"https:\/\/doi.org\/10.1145\/2976749.2978347","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"}}]}}