{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T15:21:48Z","timestamp":1793114508456,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,9]]},"DOI":"10.1145\/3411501.3419433","type":"proceedings-article","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T03:22:57Z","timestamp":1604460177000},"page":"65-67","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["TinyGarble2"],"prefix":"10.1145","author":[{"given":"Siam","family":"Hussain","sequence":"first","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baiyu","family":"Li","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Farinaz","family":"Koushanfar","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Cammarota","sequence":"additional","affiliation":[{"name":"Intel Labs, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"27th Annual Symposium on","author":"Yao A.","year":"1986","unstructured":"A. Yao , \"How to generate and exchange secrets,\" in Foundations of Computer Science, 1986 ., 27th Annual Symposium on , 1986 . A. Yao, \"How to generate and exchange secrets,\" in Foundations of Computer Science, 1986., 27th Annual Symposium on, 1986."},{"key":"e_1_3_2_2_2_1","volume-title":"Improved garbled circuit: Free XOR gates and applications,\" in International Colloquium on Automata, Languages, and Programming. hskip 1em plus 0.5em minus 0.4emrelax Springer","author":"Kolesnikov V.","year":"2008","unstructured":"V. Kolesnikov and T. Schneider , \" Improved garbled circuit: Free XOR gates and applications,\" in International Colloquium on Automata, Languages, and Programming. hskip 1em plus 0.5em minus 0.4emrelax Springer , 2008 . V. Kolesnikov and T. Schneider, \"Improved garbled circuit: Free XOR gates and applications,\" in International Colloquium on Automata, Languages, and Programming. hskip 1em plus 0.5em minus 0.4emrelax Springer, 2008."},{"key":"e_1_3_2_2_3_1","first-page":"220","volume-title":"Two halves make a whole,\" in Theory and Applications of Cryptographic Techniques. hskip 1em plus 0.5em minus 0.4emrelax Springer","author":"Zahur S.","year":"2015","unstructured":"S. Zahur , M. Rosulek , and D. Evans , \" Two halves make a whole,\" in Theory and Applications of Cryptographic Techniques. hskip 1em plus 0.5em minus 0.4emrelax Springer , 2015 , pp. 220 -- 250 . S. Zahur, M. Rosulek, and D. Evans, \"Two halves make a whole,\" in Theory and Applications of Cryptographic Techniques. hskip 1em plus 0.5em minus 0.4emrelax Springer, 2015, pp. 220--250."},{"key":"e_1_3_2_2_4_1","volume-title":"Efficient garbling from a fixed-key blockcipher,\" in S&P. hskip 1em plus 0.5em minus 0.4emrelax IEEE","author":"Bellare M.","year":"2013","unstructured":"M. Bellare , V. T. Hoang , S. Keelveedhi , and P. Rogaway , \" Efficient garbling from a fixed-key blockcipher,\" in S&P. hskip 1em plus 0.5em minus 0.4emrelax IEEE , 2013 . M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway, \"Efficient garbling from a fixed-key blockcipher,\" in S&P. hskip 1em plus 0.5em minus 0.4emrelax IEEE, 2013."},{"key":"e_1_3_2_2_5_1","volume-title":"TinyGarble: Highly compressed and scalable sequential garbled circuits,\" in IEEE S&P","author":"Songhori E. M.","year":"2015","unstructured":"E. M. Songhori , S. U. Hussain , A.-R. Sadeghi , T. Schneider , and F. Koushanfar , \" TinyGarble: Highly compressed and scalable sequential garbled circuits,\" in IEEE S&P , 2015 . E. M. Songhori, S. U. Hussain, A.-R. Sadeghi, T. Schneider, and F. Koushanfar, \"TinyGarble: Highly compressed and scalable sequential garbled circuits,\" in IEEE S&P, 2015."},{"key":"e_1_3_2_2_6_1","first-page":"112","volume-title":"Frigate: A validated, extensible, and efficient compiler and interpreter for secure computation,\" in EuroS&P). hskip 1em plus 0.5em minus 0.4emrelax IEEE","author":"Mood B.","year":"2016","unstructured":"B. Mood , D. Gupta , H. Carter , K. Butler , and P. Traynor , \" Frigate: A validated, extensible, and efficient compiler and interpreter for secure computation,\" in EuroS&P). hskip 1em plus 0.5em minus 0.4emrelax IEEE , 2016 , pp. 112 -- 127 . B. Mood, D. Gupta, H. Carter, K. Butler, and P. Traynor, \"Frigate: A validated, extensible, and efficient compiler and interpreter for secure computation,\" in EuroS&P). hskip 1em plus 0.5em minus 0.4emrelax IEEE, 2016, pp. 112--127."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-017-0300-0"},{"key":"e_1_3_2_2_8_1","volume-title":"PCF: A portable circuit format for scalable two-party secure computation.\" in USENIX Security","author":"Kreuter B.","year":"2013","unstructured":"B. Kreuter , A. Shelat , B. Mood , and K. Butler , \" PCF: A portable circuit format for scalable two-party secure computation.\" in USENIX Security , 2013 . B. Kreuter, A. Shelat, B. Mood, and K. Butler, \"PCF: A portable circuit format for scalable two-party secure computation.\" in USENIX Security, 2013."},{"key":"e_1_3_2_2_9_1","volume-title":"ABY-a framework for efficient mixed-protocol secure two-party computation.\" in NDSS. hskip 1em plus 0.5em minus 0.4emrelax The Internet Society","author":"Demmler D.","year":"2015","unstructured":"D. Demmler , T. Schneider , and M. Zohner , \" ABY-a framework for efficient mixed-protocol secure two-party computation.\" in NDSS. hskip 1em plus 0.5em minus 0.4emrelax The Internet Society , 2015 . D. Demmler, T. Schneider, and M. Zohner, \"ABY-a framework for efficient mixed-protocol secure two-party computation.\" in NDSS. hskip 1em plus 0.5em minus 0.4emrelax The Internet Society, 2015."},{"key":"e_1_3_2_2_10_1","first-page":"1153","article-title":"Obliv-C: A language for extensible data-oblivious computation","volume":"2015","author":"Zahur S.","year":"2015","unstructured":"S. Zahur and D. Evans , \" Obliv-C: A language for extensible data-oblivious computation .\" IACR Cryptology ePrint Archive , vol. 2015 , p. 1153 , 2015 . S. Zahur and D. Evans, \"Obliv-C: A language for extensible data-oblivious computation.\" IACR Cryptology ePrint Archive, vol. 2015, p. 1153, 2015.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_11_1","volume-title":"EMP-toolkit: Efficient MultiParty computation toolkit,\" https:\/\/github.com\/emp-toolkit","author":"Wang X.","year":"2016","unstructured":"X. Wang , A. J. Malozemoff , and J. Katz , \" EMP-toolkit: Efficient MultiParty computation toolkit,\" https:\/\/github.com\/emp-toolkit , 2016 . X. Wang, A. J. Malozemoff, and J. Katz, \"EMP-toolkit: Efficient MultiParty computation toolkit,\" https:\/\/github.com\/emp-toolkit, 2016."},{"key":"e_1_3_2_2_12_1","volume-title":"Gradient-based learning applied to document recognition,\" Proceedings of the IEEE","author":"LeCun Y.","unstructured":"Y. LeCun , L. Bottou , Y. Bengio , and P. Haffner , \" Gradient-based learning applied to document recognition,\" Proceedings of the IEEE , vol. 86 , no. 11, 1998. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, \"Gradient-based learning applied to document recognition,\" Proceedings of the IEEE, vol. 86, no. 11, 1998."},{"key":"e_1_3_2_2_13_1","unstructured":"P. Plonski \"keras2cpp \" https:\/\/github.com\/pplonski\/keras2cpp 2020.  P. Plonski \"keras2cpp \" https:\/\/github.com\/pplonski\/keras2cpp 2020."},{"key":"e_1_3_2_2_14_1","unstructured":"N. Mariella \"From keras to c \" https:\/\/github.com\/aljabr0\/from-keras-to-c 2019.  N. Mariella \"From keras to c \" https:\/\/github.com\/aljabr0\/from-keras-to-c 2019."}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 Workshop on Privacy-Preserving Machine Learning in Practice"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411501.3419433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3411501.3419433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:41Z","timestamp":1750195901000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411501.3419433"}},"subtitle":["Smart, Efficient, and Scalable Yao's Garble Circuit"],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":14,"alternative-id":["10.1145\/3411501.3419433","10.1145\/3411501"],"URL":"https:\/\/doi.org\/10.1145\/3411501.3419433","relation":{},"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"2020-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}