{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:29:44Z","timestamp":1766449784669,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1909769"],"award-info":[{"award-number":["1909769"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484764","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"574-593","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["One Hot Garbling"],"prefix":"10.1145","author":[{"given":"David","family":"Heath","sequence":"first","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"David Archer Victor Arribas Abril Steve Lu Pieter Maene Nele Mertens Danilo Sijacic and Nigel Smart. 'bristol fashion' mpc circuits. https:\/\/homes.esat.kuleuven.be\/ nsmart\/MPC."},{"key":"e_1_3_2_2_2_1","series-title":"LNCS","first-page":"223","volume-title":"Yuval Ishai, Michael Nielsen, and Lior Zichron. Secure arithmetic computation with constant computational overhead","author":"Applebaum Benny","year":"2017","unstructured":"Benny Applebaum, Ivan Damgr ard, Yuval Ishai, Michael Nielsen, and Lior Zichron. Secure arithmetic computation with constant computational overhead. In Jonathan Katz and Hovav Shacham, editors, CRYPTO 2017, Part I, volume 10401 of LNCS, pages 223--254. Springer, Heidelberg, August 2017."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. Efficient pseudorandom correlation generators: Silent OT extension and more. In Alexandra Boldyreva and Daniele Micciancio editors CRYPTO 2019 Part III volume 11694 of LNCS pages 489--518. Springer Heidelberg August 2019.","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_2_2_4_1","unstructured":"Joan Boyar Morris Dworkin Rene Peralta Meltem Turan Cagdas Calik and Luis Brandao. Circuit Minimization Work. http:\/\/cs-www.cs.yale.edu\/homes\/peralta\/CircuitStuff\/CMT.html 2020."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Shafi Goldwasser and Ioana Ivan. Functional signatures and pseudorandom functions. In Hugo Krawczyk editor PKC 2014 volume 8383 of LNCS pages 501--519. Springer Heidelberg March 2014.","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_2_7_1","first-page":"784","volume-title":"ACM CCS 2012","author":"Bellare Mihir","year":"2012","unstructured":"Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. Foundations of garbled circuits. In Ting Yu, George Danezis, and Virgil D. Gligor, editors, ACM CCS 2012, pages 784--796. ACM Press, October 2012."},{"key":"e_1_3_2_2_8_1","first-page":"201","volume-title":"8th ACM PODC","author":"Bar-Ilan Judit","year":"1989","unstructured":"Judit Bar-Ilan and Donald Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In Piotr Rudnicki, editor, 8th ACM PODC, pages 201--209. ACM, August 1989."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9124-7"},{"key":"e_1_3_2_2_10_1","first-page":"503","volume-title":"22nd ACM STOC","author":"Beaver Donald","year":"1990","unstructured":"Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols (extended abstract). In 22nd ACM STOC, pages 503--513. ACM Press, May 1990."},{"key":"e_1_3_2_2_11_1","first-page":"565","volume-title":"ACM CCS 2016","author":"Ball Marshall","year":"2016","unstructured":"Marshall Ball, Tal Malkin, and Mike Rosulek. Garbling gadgets for Boolean and arithmetic circuits. In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, ACM CCS 2016, pages 565--577. ACM Press, October 2016."},{"key":"e_1_3_2_2_12_1","volume-title":"A new combinational logic minimization technique with applications to cryptology. Experimental Algorithms Lecture Notes in Computer Science, page 178--189","author":"Boyar Joan","year":"2010","unstructured":"Joan Boyar and Ren\u00e9 Peralta. A new combinational logic minimization technique with applications to cryptology. Experimental Algorithms Lecture Notes in Computer Science, page 178--189, 2010."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Brent Waters. Constrained pseudorandom functions and their applications. In Kazue Sako and Palash Sarkar editors ASIACRYPT 2013 Part II volume 8270 of LNCS pages 280--300. Springer Heidelberg December 2013.","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Seung Geol Choi Jonathan Katz Ranjit Kumaresan and Hong-Sheng Zhou. On the security of the \u201cfree-XOR\u201d technique. In Ronald Cramer editor TCC 2012 volume 7194 of LNCS pages 39--53. Springer Heidelberg March 2012.","DOI":"10.1007\/978-3-642-28914-9_3"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23097"},{"key":"e_1_3_2_2_16_1","series-title":"LNCS","first-page":"167","volume-title":"Michael Nielsen, and Samuel Ranellucci. The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited","author":"Ivan Damgr","year":"2017","unstructured":"Ivan Damgr ard, Jesper Buus Nielsen, Michael Nielsen, and Samuel Ranellucci. The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited. In Jonathan Katz and Hovav Shacham, editors, CRYPTO 2017, Part I, volume 10401 of LNCS, pages 167--187. Springer, Heidelberg, August 2017."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133967"},{"key":"e_1_3_2_2_18_1","first-page":"464","volume-title":"25th FOCS","author":"Goldreich Oded","year":"1984","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions (extended abstract). In 25th FOCS, pages 464--479. IEEE Computer Society Press, October 1984."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-006-9046-1"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00016"},{"key":"e_1_3_2_2_21_1","unstructured":"Adam Groce Alex Ledger Alex J. Malozemoff and Arkady Yerukhimovich. CompGC: Efficient offline\/online semi-honest two-party computation. Cryptology ePrint Archive Report 2016\/458 2016. https:\/\/eprint.iacr.org\/2016\/458."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-017-9271-y"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"David Heath and Vladimir Kolesnikov. Stacked garbling - garbled circuit proportional to longest execution path. In Daniele Micciancio and Thomas Ristenpart editors CRYPTO 2020 Part II volume 12171 of LNCS pages 763--792. Springer Heidelberg August 2020.","DOI":"10.1007\/978-3-030-56880-1_27"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"David Heath and Vladimir Kolesnikov. Stacked garbling for disjunctive zero-knowledge proofs. In Anne Canteaut and Yuval Ishai editors EUROCRYPT 2020 Part III volume 12107 of LNCS pages 569--598. Springer Heidelberg May 2020.","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"e_1_3_2_2_25_1","unstructured":"David Heath and Vladimir Kolesnikov. Logstack: Stacked garbling with o(b log b) computation. Cryptology ePrint Archive Report 2021\/531 2021. https:\/\/eprint.iacr.org\/2015\/751.pdf."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_1"},{"key":"e_1_3_2_2_27_1","first-page":"451","volume-title":"ACM CCS 2010","author":"Henecka Wilko","year":"2010","unstructured":"Wilko Henecka, Stefan K\u00f6gl, Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. TASTY: tool for automating secure two-party computations. In Ehab Al-Shaer, Angelos D. Keromytis, and Vitaly Shmatikov, editors, ACM CCS 2010, pages 451--462. ACM Press, October 2010."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Sigurd Meldgaard Claudio Orlandi and Anat Paskin-Cherniavsky. On the power of correlated randomness in secure computation. In Amit Sahai editor TCC 2013 volume 7785 of LNCS pages 600--620. Springer Heidelberg March 2013.","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"e_1_3_2_2_29_1","first-page":"955","volume-title":"ACM CCS 2013","author":"Jawurek Marek","year":"2013","unstructured":"Marek Jawurek, Florian Kerschbaum, and Claudio Orlandi. Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 955--966. ACM Press, November 2013."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2015.7357416"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"W. Sean Kennedy Vladimir Kolesnikov and Gordon T. Wilfong. Overlaying conditional circuit clauses for secure computation. In Tsuyoshi Takagi and Thomas Peyrin editors ASIACRYPT 2017 Part II volume 10625 of LNCS pages 499--528. Springer Heidelberg December 2017.","DOI":"10.1007\/978-3-319-70697-9_18"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Payman Mohassel and Mike Rosulek. FleXOR: Flexible garbling for XOR gates that beats free-XOR. In Juan A. Garay and Rosario Gennaro editors CRYPTO 2014 Part II volume 8617 of LNCS pages 440--457. Springer Heidelberg August 2014.","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"e_1_3_2_2_33_1","first-page":"3","volume-title":"Mike Rosulek, Ni Trieu, and Roberto Trifiletti. DUPLO: Unifying cut-and-choose for garbled circuits. In Bhavani M. Thuraisingham","author":"Kolesnikov Vladimir","year":"2017","unstructured":"Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, and Roberto Trifiletti. DUPLO: Unifying cut-and-choose for garbled circuits. In Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, editors, ACM CCS 2017, pages 3--20. ACM Press, October \/ November 2017."},{"key":"e_1_3_2_2_34_1","first-page":"669","volume-title":"ACM CCS 2013","author":"Kiayias Aggelos","year":"2013","unstructured":"Aggelos Kiayias, Stavros Papadopoulos, Nikos Triandopoulos, and Thomas Zacharias. Delegatable pseudorandom functions and applications. In Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 669--684. ACM Press, November 2013."},{"key":"e_1_3_2_2_35_1","unstructured":"Vladimir Kolesnikov and Thomas Schneider. Improved garbled circuit: Free XOR gates and applications. In Luca Aceto Ivan Damg\u00e5rd Leslie Ann Goldberg Magn\u00fas M. Halld\u00f3rsson Anna Ing\u00f3lfsd\u00f3ttir and Igor Walukiewicz editors ICALP 2008 Part II volume 5126 of LNCS pages 486--498. Springer Heidelberg July 2008."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Thomas Schneider Nigel P. Smart and Stephen C. Williams. Secure two-party computation is practical. In Mitsuru Matsui editor ASIACRYPT 2009 volume 5912 of LNCS pages 250--267. Springer Heidelberg December 2009.","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_2_38_1","unstructured":"Arpita Patra Thomas Schneider Ajith Suresh and Hossein Yalame. ABY2. 0: Improved mixed-protocol secure two-party computation. Cryptology ePrint Archive Report 2020\/1225 2020. https:\/\/eprint.iacr.org\/2020\/1225."},{"key":"e_1_3_2_2_39_1","first-page":"94","volume-title":"Three halves make a whole? Beating the half-gates lower bound for garbled circuits. LNCS","author":"Rosulek Mike","year":"2021","unstructured":"Mike Rosulek and Lawrence Roy. Three halves make a whole? Beating the half-gates lower bound for garbled circuits. LNCS, pages 94--124. Springer, Heidelberg, 2021."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196522"},{"key":"e_1_3_2_2_41_1","first-page":"1055","volume-title":"ACM CCS 2019","author":"Schoppmann Phillipp","year":"2019","unstructured":"Phillipp Schoppmann, Adri\u00e0 Gasc\u00f3n, Leonie Reichert, and Mariana Raykova. Distributed vector-OLE: Improved constructions and implementation. In Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, editors, ACM CCS 2019, pages 1055--1072. ACM Press, November 2019."},{"key":"e_1_3_2_2_42_1","volume-title":"EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit","author":"Wang Xiao","year":"2016","unstructured":"Xiao Wang, Alex J. Malozemoff, and Jonathan Katz. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit, 2016."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417276"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Samee Zahur Mike Rosulek and David Evans. Two halves make a whole - reducing data transfer in garbled circuits using half gates. In Elisabeth Oswald and Marc Fischlin editors EUROCRYPT 2015 Part II volume 9057 of LNCS pages 220--250. Springer Heidelberg April 2015.","DOI":"10.1007\/978-3-662-46803-6_8"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event Republic of Korea","acronym":"CCS '21"},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484764","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484764","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:49:53Z","timestamp":1763498993000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":45,"alternative-id":["10.1145\/3460120.3484764","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484764","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}