{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:25Z","timestamp":1750221085517,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"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"}],"funder":[{"name":"CRISP"},{"name":"CROSSING","award":["CRC 1119"],"award-info":[{"award-number":["CRC 1119"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3278521","type":"proceedings-article","created":{"date-parts":[[2018,11,13]],"date-time":"2018-11-13T13:39:38Z","timestamp":1542116378000},"page":"2300-2302","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Removing the Bottleneck for Practical 2PC"],"prefix":"10.1145","author":[{"given":"Kris","family":"Shrishak","sequence":"first","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]},{"given":"Haya","family":"Shulman","sequence":"additional","affiliation":[{"name":"Fraunhofer SIT & TU Darmstadt, Darmstadt, Germany"}]},{"given":"Michael","family":"Waidner","sequence":"additional","affiliation":[{"name":"Fraunhofer SIT & TU Darmstadt, Darmstadt, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"volume-title":"ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation","author":"Demmler Daniel","key":"e_1_3_2_1_6_1","unstructured":"Daniel Demmler , Thomas Schneider , and Michael Zohner . 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation . In NDSS. The Internet Society . Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS. The Internet Society."},{"key":"e_1_3_2_1_7_1","first-page":"629","article-title":"SCAPI: The Secure Computation Application Programming Interface","volume":"2012","author":"Ejgenberg Yael","year":"2012","unstructured":"Yael Ejgenberg , Moriya Farbstein , Meital Levy , and Yehuda Lindell . 2012 . SCAPI: The Secure Computation Application Programming Interface . IACR Cryptology ePrint Archive , Vol. 2012 (2012), 629 . Yael Ejgenberg, Moriya Farbstein, Meital Levy, and Yehuda Lindell. 2012. SCAPI: The Secure Computation Application Programming Interface. IACR Cryptology ePrint Archive , Vol. 2012 (2012), 629.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813619"},{"key":"e_1_3_2_1_10_1","volume-title":"Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium . USENIX Association.","author":"Huang Yan","year":"2011","unstructured":"Yan Huang , David Evans , Jonathan Katz , and Lior Malka . 2011 . Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium . USENIX Association. Yan Huang, David Evans, Jonathan Katz, and Lior Malka. 2011. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium . USENIX Association."},{"volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Ishai Yuval","key":"e_1_3_2_1_11_1","unstructured":"Yuval Ishai , Joe Kilian , Kobbi Nissim , and Erez Petrank . 2003. Extending Oblivious Transfers Efficiently . In CRYPTO (Lecture Notes in Computer Science) , , Vol. 2729 . Springer , 145--161. Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO (Lecture Notes in Computer Science), , Vol. 2729. Springer, 145--161."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_13_1","volume-title":"Fairplay - Secure Two-Party Computation System. In USENIX Security Symposium. USENIX, 287--302","author":"Malkhi Dahlia","year":"2004","unstructured":"Dahlia Malkhi , Noam Nisan , Benny Pinkas , and Yaron Sella . 2004 . Fairplay - Secure Two-Party Computation System. In USENIX Security Symposium. USENIX, 287--302 . Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. 2004. Fairplay - Secure Two-Party Computation System. In USENIX Security Symposium. USENIX, 287--302."},{"volume-title":"Efficient oblivious transfer protocols","author":"Naor Moni","key":"e_1_3_2_1_14_1","unstructured":"Moni Naor and Benny Pinkas . 2001. Efficient oblivious transfer protocols . In SODA. ACM\/SIAM , 448--457. Moni Naor and Benny Pinkas. 2001. Efficient oblivious transfer protocols. In SODA. ACM\/SIAM, 448--457."},{"volume-title":"Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO","author":"Nielsen Jesper Buus","key":"e_1_3_2_1_15_1","unstructured":"Jesper Buus Nielsen , Thomas Schneider , and Roberto Trifiletti . 2017. Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO . In NDSS. The Internet Society . Jesper Buus Nielsen, Thomas Schneider, and Roberto Trifiletti. 2017. Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS. The Internet Society."},{"volume-title":"Financial Cryptography (Lecture Notes in Computer Science)","author":"Schneider Thomas","key":"e_1_3_2_1_16_1","unstructured":"Thomas Schneider and Michael Zohner . 2013. GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits . In Financial Cryptography (Lecture Notes in Computer Science) , , Vol. 7859 . Springer , 275--292. Thomas Schneider and Michael Zohner. 2013. GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits. In Financial Cryptography (Lecture Notes in Computer Science) , , Vol. 7859. Springer, 275--292."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science)","author":"Zahur Samee","key":"e_1_3_2_1_19_1","unstructured":"Samee Zahur , Mike Rosulek , and David Evans . 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates . In EUROCRYPT (2) (Lecture Notes in Computer Science) , , Vol. 9057 . Springer , 220--250. Samee Zahur, Mike Rosulek, and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. In EUROCRYPT (2) (Lecture Notes in Computer Science) , , Vol. 9057. Springer, 220--250."}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Toronto Canada","acronym":"CCS '18"},"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.3278521","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3278521","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.3278521"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":19,"alternative-id":["10.1145\/3243734.3278521","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3278521","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"}}]}}