{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:55Z","timestamp":1778065135804,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":49,"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\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1111599 1563722 1564088"],"award-info":[{"award-number":["1111599 1563722 1564088"]}],"id":[{"id":"10.13039\/100000001","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.3134053","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"21-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":128,"title":["Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation"],"prefix":"10.1145","author":[{"given":"Xiao","family":"Wang","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Ranellucci","sequence":"additional","affiliation":[{"name":"University of Maryland & George Mason University, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Non-Interactive Secure Computation Based on Cut-and-Choose Eurocrypt 2014 (LNCS)","author":"Afshar Arash","unstructured":"Arash Afshar, Payman Mohassel, Benny Pinkas, and Ben Riva. 2014. Non-Interactive Secure Computation Based on Cut-and-Choose Eurocrypt 2014 (LNCS), Vol. Vol. 8441. 387--404."},{"key":"e_1_3_2_2_2_1","volume-title":"More efficient oblivious transfer and extensions for faster secure computation ACM CCS","author":"Asharov Gilad","year":"2013","unstructured":"Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner 2013. More efficient oblivious transfer and extensions for faster secure computation ACM CCS 2013. 535--548."},{"key":"e_1_3_2_2_3_1","volume-title":"Efficient Multiparty Protocols Using Circuit Randomization Crypto'91 (LNCS)","author":"Beaver Donald","unstructured":"Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization Crypto'91 (LNCS), Vol. Vol. 576. 420--432."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","unstructured":"Donald Beaver Silvio Micali and Phillip Rogaway. 1990. The Round Complexity of Secure Protocols. In ACM STOC. 503--513. 10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_2_6_1","volume-title":"ASIACRYPT","volume":"8270","author":"Lu'\u0131s T. A.","year":"2013","unstructured":"Lu'\u0131s T. A. N. Brand ao. 2013. Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique. In ASIACRYPT 2013, Part II (LNCS), Vol. Vol. 8270. 441--463."},{"key":"e_1_3_2_2_7_1","volume-title":"Efficient Three-Party Computation from Cut-and-Choose Crypto","author":"Choi Seung Geol","year":"2014","unstructured":"Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, and Vassilis Zikas 2014. Efficient Three-Party Computation from Cut-and-Choose Crypto 2014, Part II (LNCS), Vol. Vol. 8617. 513--530."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"e_1_3_2_2_9_1","volume-title":"Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator Crypto 2005 (LNCS)","author":"Damg\u00e5rd Ivan","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai 2005. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator Crypto 2005 (LNCS), Vol. Vol. 3621. 378--394."},{"key":"e_1_3_2_2_10_1","volume-title":"An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation Intl. Conf. on Security and Cryptography for Networks (LNCS)","volume":"8642","author":"Ivan Damgr","year":"2014","unstructured":"Ivan Damgr ard, Rasmus Lauritsen, and Tomas Toft. 2014. An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation Intl. Conf. on Security and Cryptography for Networks (LNCS), Vol. Vol. 8642. 398--415."},{"key":"e_1_3_2_2_11_1","volume-title":"Part I (LNCS)","volume":"10401","author":"Ivan Damgr","year":"2017","unstructured":"Ivan Damgr ard, Jesper Buus Nielsen, Michael Nielsen, and Samuel Ranellucci 2017. The TinyTable protocol for 2-Party Secure Computation, or: Gate-scrambling Revisited Crypto 2017, Part I (LNCS), Vol. Vol. 10401. 167--187."},{"key":"e_1_3_2_2_12_1","volume-title":"Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias 2012. Multiparty Computation from Somewhat Homomorphic Encryption Crypto 2012 (LNCS), Vol. Vol. 7417. 643--662."},{"key":"e_1_3_2_2_13_1","volume-title":"Jesper Buus Nielsen, Peter Sebastian Nordholt, and Claudio Orlandi","author":"Frederiksen Tore Kasper","year":"2013","unstructured":"Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, and Claudio Orlandi 2013. MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions Eurocrypt 2013 (LNCS), Vol. Vol. 7881. 537--556."},{"key":"e_1_3_2_2_14_1","volume-title":"Jesper Buus Nielsen, and Roberto Trifiletti","author":"Frederiksen Tore Kasper","year":"2015","unstructured":"Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, and Roberto Trifiletti 2015. TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-Party Computation. Cryptology ePrint Archive, Report 2015\/309. (2015). http:\/\/eprint.iacr.org\/2015\/309."},{"key":"e_1_3_2_2_15_1","volume-title":"How to Play any Mental Game, or A Completeness Theorem for Protocols with Honest Majority 19th ACM STOC. 218--229","author":"Goldreich Oded","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game, or A Completeness Theorem for Protocols with Honest Majority 19th ACM STOC. 218--229."},{"key":"e_1_3_2_2_17_1","volume-title":"Faster Secure Two-Party Computation Using Garbled Circuits USENIX Security","author":"Huang Yan","year":"2011","unstructured":"Yan Huang, David Evans, Jonathan Katz, and Lior Malka. 2011. Faster Secure Two-Party Computation Using Garbled Circuits USENIX Security 2011."},{"key":"e_1_3_2_2_18_1","volume-title":"Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose Crypto","author":"Huang Yan","year":"2013","unstructured":"Yan Huang, Jonathan Katz, and David Evans 2013. Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose Crypto 2013, Part II (LNCS), Vol. Vol. 8043. 18--35."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.56"},{"key":"e_1_3_2_2_21_1","volume-title":"Founding Cryptography on Oblivious Transfer - Efficiently Crypto 2008 (LNCS)","author":"Ishai Yuval","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. 2008. Founding Cryptography on Oblivious Transfer - Efficiently Crypto 2008 (LNCS), Vol. Vol. 5157. 572--591."},{"key":"e_1_3_2_2_22_1","volume-title":"Efficient Two-Party Secure Computation on Committed Inputs Eurocrypt 2007 (LNCS)","author":"Jarecki Stanislaw","unstructured":"Stanislaw Jarecki and Vitaly Shmatikov 2007. Efficient Two-Party Secure Computation on Committed Inputs Eurocrypt 2007 (LNCS), Vol. Vol. 4515. 97--114."},{"key":"e_1_3_2_2_23_1","volume-title":"Actively Secure OT Extension with Optimal Overhead Crypto","author":"Keller Marcel","year":"2015","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead Crypto 2015, Part I (LNCS), Vol. Vol. 9215. 724--741."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_25_1","volume-title":"FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR Crypto","author":"Kolesnikov Vladimir","year":"2014","unstructured":"Vladimir Kolesnikov, Payman Mohassel, and Mike Rosulek. 2014. FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR Crypto 2014, Part II (LNCS), Vol. Vol. 8617. 440--457."},{"key":"e_1_3_2_2_26_1","volume-title":"Mike Rosulek, Ni Trieu, and Roberto Trifiletti.","author":"Kolesnikov Vladimir","year":"2017","unstructured":"Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, and Roberto Trifiletti. 2017. DUPLO: Unifying Cut-and-Choose for Garbled Circuits ACM CCS 2017."},{"key":"e_1_3_2_2_27_1","volume-title":"Improved Garbled Circuit: Free XOR Gates and Applications ICALP","volume":"5126","author":"Kolesnikov Vladimir","year":"2008","unstructured":"Vladimir Kolesnikov and Thomas Schneider 2008. Improved Garbled Circuit: Free XOR Gates and Applications ICALP 2008, Part II (LNCS), Vol. Vol. 5126. 486--498."},{"key":"e_1_3_2_2_28_1","volume-title":"Billion-Gate Secure Computation with Malicious Adversaries USENIX Security","author":"Kreuter Benjamin","year":"2012","unstructured":"Benjamin Kreuter, Abhi Shelat, and Chih-Hao Shen. 2012. Billion-Gate Secure Computation with Malicious Adversaries USENIX Security 2012."},{"key":"e_1_3_2_2_29_1","volume-title":"Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries Crypto","author":"Lindell Yehuda","year":"2013","unstructured":"Yehuda Lindell. 2013. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries Crypto 2013, Part II (LNCS), Vol. Vol. 8043. 1--17."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_3_2_2_31_1","volume-title":"Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer TCC 2011 (LNCS)","author":"Lindell Yehuda","unstructured":"Yehuda Lindell and Benny Pinkas 2011. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer TCC 2011 (LNCS), Vol. Vol. 6597. 329--346."},{"key":"e_1_3_2_2_32_1","volume-title":"Part II (LNCS)","volume":"9216","author":"Lindell Yehuda","year":"2015","unstructured":"Yehuda Lindell, Benny Pinkas, Nigel P. Smart, and Avishay Yanai 2015. Efficient Constant Round Multi-party Computation Combining BMR and SPDZ Crypto 2015, Part II (LNCS), Vol. Vol. 9216. 319--338."},{"key":"e_1_3_2_2_33_1","volume-title":"Cut-and-Choose Yao-Based Secure Computation in the Online\/Offline and Batch Settings Crypto","author":"Lindell Yehuda","year":"2014","unstructured":"Yehuda Lindell and Ben Riva 2014. Cut-and-Choose Yao-Based Secure Computation in the Online\/Offline and Batch Settings Crypto 2014, Part II (LNCS), Vol. Vol. 8617. 476--494."},{"key":"e_1_3_2_2_34_1","volume-title":"Blazing Fast 2PC in the Offline\/Online Setting with Security for Malicious Adversaries ACM CCS","author":"Lindell Yehuda","year":"2015","unstructured":"Yehuda Lindell and Ben Riva 2015. Blazing Fast 2PC in the Offline\/Online Setting with Security for Malicious Adversaries ACM CCS 2015. 579--590."},{"key":"e_1_3_2_2_35_1","volume-title":"Part I (LNCS)","volume":"9985","author":"Lindell Yehuda","year":"2016","unstructured":"Yehuda Lindell, Nigel P. Smart, and Eduardo Soria-Vazquez. 2016. More Efficient Constant-Round Multi-party Computation from BMR and SHE TCC 2016-B, Part I (LNCS), Vol. Vol. 9985. 554--581."},{"key":"e_1_3_2_2_36_1","volume-title":"Fairplay--A Secure Two-Party Computation System. USENIX Security","author":"Malkhi Dahlia","year":"2004","unstructured":"Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. 2004. Fairplay--A Secure Two-Party Computation System. USENIX Security 2004."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0006"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Jesper Nielsen Thomas Schneider and Roberto Trifiletti. 2017. Constant-Round Maliciously Secure 2PC with Function-Independent Preprocessing Using LEGO Network and Distributed System Security Symposium (NDSS).","DOI":"10.14722\/ndss.2017.23075"},{"key":"e_1_3_2_2_39_1","volume-title":"Claudio Orlandi, and Sai Sheshank Burra.","author":"Nielsen Jesper Buus","year":"2012","unstructured":"Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012. A New Approach to Practical Active-Secure Two-Party Computation Crypto 2012 (LNCS), Vol. Vol. 7417. 681--700."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"e_1_3_2_2_41_1","volume-title":"Cross and Clean: Amortized Garbled Circuits with Constant Overhead TCC 2016-B, Part I (LNCS)","volume":"9985","author":"Nielsen Jesper Buus","year":"2016","unstructured":"Jesper Buus Nielsen and Claudio Orlandi 2016. Cross and Clean: Amortized Garbled Circuits with Constant Overhead TCC 2016-B, Part I (LNCS), Vol. Vol. 9985. 582--603."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_2_43_1","volume-title":"Faster Malicious 2-Party Secure Computation with Online\/Offline Dual Execution USENIX Security","author":"Rindal Peter","year":"2016","unstructured":"Peter Rindal and Mike Rosulek 2016. Faster Malicious 2-Party Secure Computation with Online\/Offline Dual Execution USENIX Security 2016."},{"key":"e_1_3_2_2_44_1","volume-title":"Two-Output Secure Computation with Malicious Adversaries Eurocrypt 2011 (LNCS)","author":"Shelat Abhi","unstructured":"Abhi Shelat and Chih-Hao Shen 2011. Two-Output Secure Computation with Malicious Adversaries Eurocrypt 2011 (LNCS), Vol. Vol. 6632. 386--405."},{"key":"e_1_3_2_2_45_1","first-page":"523","volume":"2013","author":"Shelat Abhi","year":"2013","unstructured":"Abhi Shelat and Chih-Hao Shen 2013. Fast Two-Party Secure Computation with Minimal Assumptions ACM CCS 2013. 523--534.","journal-title":"Fast Two-Party Secure Computation with Minimal Assumptions ACM CCS"},{"key":"e_1_3_2_2_46_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-Toolkit: Efficient Multiparty Computation Toolkit. https:\/\/github.com\/emp-toolkit. (2016)."},{"key":"e_1_3_2_2_47_1","volume-title":"Faster Secure Two-Party Computation in the Single-Execution Setting Eurocrypt","author":"Wang Xiao","year":"2017","unstructured":"Xiao Wang, Alex J. Malozemoff, and Jonathan Katz. 2017. Faster Secure Two-Party Computation in the Single-Execution Setting Eurocrypt 2017, Part II (LNCS), Vol. Vol. 10211. 399--424."},{"key":"e_1_3_2_2_48_1","volume-title":"Global-Scale Secure Multiparty Computation. In ACM CCS","author":"Wang Xiao","year":"2017","unstructured":"Xiao Wang, Samuel Ranellucci, and Jonathan Katz. 2017. Global-Scale Secure Multiparty Computation. In ACM CCS 2017."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_2_50_1","volume-title":"Two Halves Make a Whole-Reducing Data Transfer in Garbled Circuits Using Half Gates Eurocrypt","author":"Zahur Samee","year":"2015","unstructured":"Samee Zahur, Mike Rosulek, and David Evans. 2015. Two Halves Make a Whole-Reducing Data Transfer in Garbled Circuits Using Half Gates Eurocrypt 2015, Part II (LNCS), Vol. Vol. 9057. 220--250."}],"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.3134053","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134053","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":49,"alternative-id":["10.1145\/3133956.3134053","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134053","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"}}]}}