{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:07:14Z","timestamp":1774926434937,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"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":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3264419","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T17:38:33Z","timestamp":1539711513000},"page":"2157-2159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Secure Multi-Party Computation"],"prefix":"10.1145","author":[{"given":"Fattaneh","family":"Bayatbabolghani","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"Marina","family":"Blanton","sequence":"additional","affiliation":[{"name":"University at Buffalo, The State University of New York, Buffalo, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"G. Asharov Y. Lindell and T. Rabin. 2011. Perfectly-Secure Multiplication for Any $t < n\/3$. In CRYPTO. 240--258.   G. Asharov Y. Lindell and T. Rabin. 2011. Perfectly-Secure Multiplication for Any $t < n\/3$. In CRYPTO. 240--258.","DOI":"10.1007\/978-3-642-22792-9_14"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"G. Asharov Y. Lindell T. Schneider and M. Zohner. 2015. More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. In EUROCRYPT. 673--701.  G. Asharov Y. Lindell T. Schneider and M. Zohner. 2015. More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. In EUROCRYPT. 673--701.","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_5_1","volume-title":"Safeguarding Cryptographic Keys. In National Computer Conference","volume":"48","author":"Blakley G. R.","year":"1979"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"e_1_3_2_1_9_1","volume-title":"Practical Covertly Secure MPC for Dishonest Majority--Or: Breaking the SPDZ Limits. In European Symposium on Research in Computer Security (ESORICS). 1--18","author":"Damg\u00e5rd I."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd and J. B. Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation CRYPTO. 572--590.   I. Damg\u00e5rd and J. B. Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation CRYPTO. 572--590.","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Y. Ishai J. Kilian K. Nissim and E. Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO. 145--161.  Y. Ishai J. Kilian K. Nissim and E. Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO. 145--161.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_17_1","volume-title":"Overdrive: Making SPDZ Great Again. In EUROCRYPT. 158--189.","author":"Keller M.","year":"2018"},{"key":"e_1_3_2_1_19_1","unstructured":"M. Kiraz and B. Schoenmakers. 2006. A Protocol Issue for the Malicious Case of Yao's Garbled Circuit Construction Symposium on Information Theory in the Benelux. 283--290.  M. Kiraz and B. Schoenmakers. 2006. A Protocol Issue for the Malicious Case of Yao's Garbled Circuit Construction Symposium on Information Theory in the Benelux. 283--290."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_21_1","volume-title":"Billion-Gate Secure Computation with Malicious Adversaries USENIX Security Symposium. 285--300","author":"Kreuter B."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Y. Lindell. 2013. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries CRYPTO. 1--17.  Y. Lindell. 2013. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries CRYPTO. 1--17.","DOI":"10.1007\/978-3-642-40084-1_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_30"},{"key":"e_1_3_2_1_26_1","volume-title":"Efficient Oblivious Transfer Protocols. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 448--457","author":"Naor M."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"A. Shelat and C. Shen. 2011. Two-Output Secure Computation with Malicious Adversaries EUROCRYPT. 386--405.   A. Shelat and C. Shen. 2011. Two-Output Secure Computation with Malicious Adversaries EUROCRYPT. 386--405.","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_31_1","unstructured":"S. Zahur and D. Evans. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. IACR Cryptology ePrint Archive Report 2015\/1153.  S. Zahur and D. Evans. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. IACR Cryptology ePrint Archive Report 2015\/1153."},{"key":"e_1_3_2_1_32_1","volume-title":"Whole: Reducing Data Transfer in Garbled Circuits Using Half Gates EUROCRYPT. 220--250.","author":"Zahur S.","year":"2015"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Y. Zhang M. Blanton and F. Bayatbabolghani. 2017. Enforcing Input Correctness via Certification in Garbled Circuit Evaluation European Symposium on Research in Computer Security (ESORICS). 552--569.  Y. Zhang M. Blanton and F. Bayatbabolghani. 2017. Enforcing Input Correctness via Certification in Garbled Circuit Evaluation European Symposium on Research in Computer Security (ESORICS). 552--569.","DOI":"10.1007\/978-3-319-66399-9_30"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516752"}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3264419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3264419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:47Z","timestamp":1750208267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3264419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":33,"alternative-id":["10.1145\/3243734.3264419","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3264419","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}