{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:48Z","timestamp":1774946568056,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":56,"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":["1149647"],"award-info":[{"award-number":["1149647"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1617197"],"award-info":[{"award-number":["1617197"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The European Union's Horizon 2020 research and innovation programme","award":["731583"],"award-info":[{"award-number":["731583"]}]},{"name":"The European research council (ERC) under the European Unions's Horizon 2020 research and innovation programme","award":["669255"],"award-info":[{"award-number":["669255"]}]},{"name":"Office of Naval Research (ONR)","award":["N00014-14-C-0113"],"award-info":[{"award-number":["N00014-14-C-0113"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3133991","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["DUPLO"],"prefix":"10.1145","author":[{"given":"Vladimir","family":"Kolesnikov","sequence":"first","affiliation":[{"name":"Bell Labs, Murray Hill, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Rosulek","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ni","family":"Trieu","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Trifiletti","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_27"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_41"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_5_1","volume-title":"Viet Tung Hoang, and Phillip Rogaway","author":"Bellare Mihir","year":"2012","unstructured":"Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. 2012. Foundations of garbled circuits, See [60], 784--796."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42045-0_23"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_2_9_1","volume-title":"CRYPTO","volume":"8043","author":"Canetti Ran","year":"2013","unstructured":"Ran Canetti and Juan A. Garay (Eds.). 2013. CRYPTO 2013, Part II. LNCS, Vol. 8043. Springer."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_7"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_3"},{"key":"e_1_3_2_2_12_1","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"Daemen Joan","unstructured":"Joan Daemen and Vincent Rijmen. 2002. The Design of Rijndael: AES - The Advanced Encryption Standard. Springer. https:\/\/doi.org\/10.100\/978-3-662-04722-4"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_32"},{"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","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_23"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_21"},{"key":"e_1_3_2_2_17_1","volume-title":"Garay and Rosario Gennaro (Eds.)","author":"Juan","year":"2014","unstructured":"Juan A. Garay and Rosario Gennaro (Eds.). 2014. CRYPTO 2014, Part II. LNCS, Vol. 8617. Springer."},{"key":"e_1_3_2_2_18_1","volume-title":"STOC","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC 1987, Alfred Aho (Ed.). ACM Press, 218--229."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_17"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Andreas Holzer Martin Franz Stefan Katzenbeisser and Helmut Veith. 2012. Secure two-party computations in ANSI C See [60] 772--783.","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_2_22_1","volume-title":"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. In USENIX Security 2011. USENIX Association."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","unstructured":"Yan Huang Jonathan Katz and David Evans. 2013. Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose See [9] 18--35. https:\/\/doi.org\/10.1007\/978-3-642-40084-1_2","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523649.2523681"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_2_27_1","volume-title":"Malozemoff","author":"Kolesnikov Vladimir","year":"2015","unstructured":"Vladimir Kolesnikov and Alex J. Malozemoff. 2015. Public Verifiability in the Covert Model (Almost) for Free. In ASIACRYPT 2015, Part II (LNCS), Tetsu Iwata and Jung Hee Cheon (Eds.), Vol. 9453. Springer, 210--235. https:\/\/doi.org\/10.1007\/ 978-3-662-48800-3_9"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_11"},{"key":"e_1_3_2_2_29_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. Cryptology ePrint Archive, Report 2017\/344. (2017). http:\/\/eprint.iacr.org\/2017\/344."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_2_31_1","volume-title":"abhi shelat, and Chih-Hao Shen","author":"Kreuter Benjamin","year":"2012","unstructured":"Benjamin Kreuter, abhi shelat, and Chih-Hao Shen. 2012. Billion-Gate Secure Computation with Malicious Adversaries. In USENIX Security 2012. USENIX Association."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","unstructured":"Yehuda Lindell. 2013. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries See [9] 1--17. https:\/\/doi.org\/10.1007\/978-3-642-40084-1_1","DOI":"10.1007\/978-3-642-40084-1_1"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85855-3_2"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","unstructured":"Yehuda Lindell and Ben Riva. 2014. Cut-and-Choose Yao-Based Secure Computation in the Online\/Offline and Batch Settings See [17] 476--494. https:\/\/doi.org\/10.1007\/978-3-662-44381-1_27","DOI":"10.1007\/978-3-662-44381-1_27"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813666"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_2_39_1","volume-title":"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. In USENIX Security 2004. USENIX Association."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_30"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","unstructured":"Payman Mohassel and Ben Riva. 2013. Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation See [9] 36--53. https:\/\/doi.org\/10.1007\/978-3-642-40084-1_3","DOI":"10.1007\/978-3-642-40084-1_3"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660285"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.20"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_34"},{"key":"e_1_3_2_2_46_1","volume-title":"Annual Network and Distributed System Security Symposium (NDSS'17)","author":"Nielsen Jesper Buus","year":"2017","unstructured":"Jesper Buus Nielsen, Thomas Schneider, and Roberto Trifiletti. 2017. Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In 24. Annual Network and Distributed System Security Symposium (NDSS'17). The Internet Society."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_2_48_1","unstructured":"Peter Rindal. 2017. libOTe: an efficient portable and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe. (2017)."},{"key":"e_1_3_2_2_49_1","volume-title":"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. In USENIX Security 2016. USENIX Association."},{"key":"e_1_3_2_2_51_1","volume-title":"Two-Output Secure Computation with Malicious Adversaries. In EUROCRYPT 2011 (LNCS), Kenneth G. Paterson (Ed.)","volume":"6632","author":"Shen Chih-Hao","year":"2011","unstructured":"abhi shelat and Chih-Hao Shen. 2011. Two-Output Secure Computation with Malicious Adversaries. In EUROCRYPT 2011 (LNCS), Kenneth G. Paterson (Ed.), Vol. 6632. Springer, 386--405."},{"key":"e_1_3_2_2_52_1","volume-title":"ACM CCS","author":"Shen Chih-Hao","year":"2013","unstructured":"abhi shelat and Chih-Hao Shen. 2013. Fast two-party secure computation with minimal assumptions. In ACM CCS 2013, Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung (Eds.). ACM Press, 523--534."},{"key":"e_1_3_2_2_53_1","unstructured":"Nigel Smart and Stefan Tillich. 2017. Circuits of Basic Functions Suitable For MPC and FHE. (2017). http:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\/"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_14"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45741-3_6"},{"key":"e_1_3_2_2_59_1","volume-title":"FOCS","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In FOCS 1986. IEEE Computer Society Press, 162--167."},{"key":"e_1_3_2_2_60_1","volume-title":"ACM CCS","author":"Yu Ting","year":"2012","unstructured":"Ting Yu, George Danezis, and Virgil D. Gligor (Eds.). 2012. ACM CCS 2012. ACM Press."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"}],"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.3133991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3133991","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3133991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:26Z","timestamp":1750212806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3133991"}},"subtitle":["Unifying Cut-and-Choose for Garbled Circuits"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":56,"alternative-id":["10.1145\/3133956.3133991","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3133991","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"}}]}}