{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:02:03Z","timestamp":1773511323335,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T00:00:00Z","timestamp":1386547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1111149"],"award-info":[{"award-number":["1111149"]}],"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":[[2013,12,9]]},"DOI":"10.1145\/2523649.2523681","type":"proceedings-article","created":{"date-parts":[[2014,1,6]],"date-time":"2014-01-06T20:44:07Z","timestamp":1389041047000},"page":"169-178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["GPU and CPU parallelization of honest-but-curious secure two-party computation"],"prefix":"10.1145","author":[{"given":"Nathaniel","family":"Husted","sequence":"first","affiliation":[{"name":"Indiana University"}]},{"given":"Steven","family":"Myers","sequence":"additional","affiliation":[{"name":"Indiana University"}]},{"given":"Abhi","family":"Shelat","sequence":"additional","affiliation":[{"name":"University of Virginia"}]},{"given":"Paul","family":"Grubbs","sequence":"additional","affiliation":[{"name":"Indiana University"}]}],"member":"320","published-online":{"date-parts":[[2013,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_2_1","unstructured":"Campbell I. Baremetal vs. xen vs. kvm --- redux. http:\/\/blog.xen.org\/index.php\/2011\/11\/29\/baremetal-vs-xen-vs-kvm-redux\/ (Nov 2011).  Campbell I. Baremetal vs. xen vs. kvm --- redux. http:\/\/blog.xen.org\/index.php\/2011\/11\/29\/baremetal-vs-xen-vs-kvm-redux\/ (Nov 2011)."},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"N. P., and Zakarias, S. Multiparty computation from somewhat homomorphic encryption. In CRYPTO","author":"Damg\u00e5rd I.","year":"2012","unstructured":"Damg\u00e5rd , I. , Pastro , V. , Smart , N. P., and Zakarias, S. Multiparty computation from somewhat homomorphic encryption. In CRYPTO ( 2012 ), R. Safavi-Naini and R. Canetti, Eds ., vol. 7417 of Lecture Notes in Computer Science , Springer , pp. 643 -- 662 . Damg\u00e5rd, I., Pastro, V., Smart, N. P., and Zakarias, S. Multiparty computation from somewhat homomorphic encryption. In CRYPTO (2012), R. Safavi-Naini and R. Canetti, Eds., vol. 7417 of Lecture Notes in Computer Science, Springer, pp. 643--662."},{"key":"e_1_3_2_1_4_1","volume-title":"Scapi: The secure computation application programming interface. IACR Cryptology ePrint Archive 2012","author":"Ejgenberg Y.","year":"2012","unstructured":"Ejgenberg , Y. , Farbstein , M. , Levy , M. , and Lindell , Y . Scapi: The secure computation application programming interface. IACR Cryptology ePrint Archive 2012 ( 2012 ), 629. Ejgenberg, Y., Farbstein, M., Levy, M., and Lindell, Y. Scapi: The secure computation application programming interface. IACR Cryptology ePrint Archive 2012 (2012), 629."},{"key":"e_1_3_2_1_6_1","volume-title":"Basic Applications","author":"Goldreich O.","year":"2004","unstructured":"Goldreich , O. Foundations of Cryptography , vol. 2 : Basic Applications . Cambridge University Press , Cambridge, UK , 2004 . Goldreich, O. Foundations of Cryptography, vol. 2: Basic Applications. Cambridge University Press, Cambridge, UK, 2004."},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-540-78967-3_17","volume-title":"EUROCRYPT","author":"Goyal V.","year":"2008","unstructured":"Goyal , V. , Mohassel , P. , and Smith , A . Efficient two party and multi party computation against covert adversaries . In EUROCRYPT ( 2008 ), N. P. Smart, Ed ., vol. 4965 of Lecture Notes in Computer Science , Springer , pp. 289 -- 306 . Goyal, V., Mohassel, P., and Smith, A. Efficient two party and multi party computation against covert adversaries. In EUROCRYPT (2008), N. P. Smart, Ed., vol. 4965 of Lecture Notes in Computer Science, Springer, pp. 289--306."},{"key":"e_1_3_2_1_8_1","volume-title":"USENIX Security Symposium","author":"Huang Y.","year":"2011","unstructured":"Huang , Y. , Evans , D. , Katz , J. , and Malka , L . Faster secure two-party computation using garbled circuits . In USENIX Security Symposium ( 2011 ). Huang, Y., Evans, D., Katz, J., and Malka, L. Faster secure two-party computation using garbled circuits. In USENIX Security Symposium (2011)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.43"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"e_1_3_2_1_11_1","first-page":"145","article-title":"Extending oblivious transfers efficiently","volume":"2003","author":"Ishai Y.","year":"2003","unstructured":"Ishai , Y. , Kilian , J. , Nissim , K. , and Petrank , E . Extending oblivious transfers efficiently . Advances in Cryptology-CRYPTO 2003 ( 2003 ), 145 -- 161 . Ishai, Y., Kilian, J., Nissim, K., and Petrank, E. Extending oblivious transfers efficiently. Advances in Cryptology-CRYPTO 2003 (2003), 145--161.","journal-title":"Advances in Cryptology-CRYPTO"},{"key":"e_1_3_2_1_12_1","first-page":"1","volume-title":"Proceedings of the 8th USENIX conference on Networked systems design and implementation","author":"Jang K.","year":"2011","unstructured":"Jang , K. , Han , S. , Han , S. , Moon , S. , and Park , K . Sslshader: cheap ssl acceleration with commodity processors . In Proceedings of the 8th USENIX conference on Networked systems design and implementation ( 2011 ), USENIX Association , pp. 1 -- 1 . Jang, K., Han, S., Han, S., Moon, S., and Park, K. Sslshader: cheap ssl acceleration with commodity processors. In Proceedings of the 8th USENIX conference on Networked systems design and implementation (2011), USENIX Association, pp. 1--1."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_14_1","first-page":"2013","article-title":"Pcf: A portable circuit format for scalable two-party secure computation","author":"Kreuter B.","year":"2013","unstructured":"Kreuter , B. , Mood , B. , shelat, a., and Butler , K . Pcf: A portable circuit format for scalable two-party secure computation . In To Appear in USENIX Security 2013 ( 2013 ). Kreuter, B., Mood, B., shelat, a., and Butler, K. Pcf: A portable circuit format for scalable two-party secure computation. In To Appear in USENIX Security 2013 (2013).","journal-title":"To Appear in USENIX Security"},{"key":"e_1_3_2_1_15_1","first-page":"14","volume-title":"Proceedings of the 21st USENIX conference on Security symposium","volume":"12","author":"Kreuter B.","year":"2012","unstructured":"Kreuter , B. , Shelat , A. , and Shen , C . -H. Billion-gate secure computation with malicious adversaries . In Proceedings of the 21st USENIX conference on Security symposium , Security ( 2012 ), vol. 12 , pp. 14 -- 14 . Kreuter, B., Shelat, A., and Shen, C.-H. Billion-gate secure computation with malicious adversaries. In Proceedings of the 21st USENIX conference on Security symposium, Security (2012), vol. 12, pp. 14--14."},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"CRYPTO (2)","author":"Lindell Y.","year":"2013","unstructured":"Lindell , Y. Fast cut-and-choose based protocols for malicious and covert adversaries . In CRYPTO (2) ( 2013 ), R. Canetti and J. A. Garay, Eds ., vol. 8043 of Lecture Notes in Computer Science , Springer , pp. 1 -- 17 . Lindell, Y. Fast cut-and-choose based protocols for malicious and covert adversaries. In CRYPTO (2) (2013), R. Canetti and J. A. Garay, Eds., vol. 8043 of Lecture Notes in Computer Science, Springer, pp. 1--17."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251395"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_30"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0102-6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/978-3-642-20465-4_22","volume-title":"EUROCRYPT","author":"Shelat A.","year":"2011","unstructured":"Shelat , A. , and Shen , C . -H. Two-output secure computation with malicious adversaries . In EUROCRYPT ( 2011 ), K. G. Paterson, Ed ., vol. 6632 of Lecture Notes in Computer Science , Springer , pp. 386 -- 405 . Shelat, A., and Shen, C.-H. Two-output secure computation with malicious adversaries. In EUROCRYPT (2011), K. G. Paterson, Ed., vol. 6632 of Lecture Notes in Computer Science, Springer, pp. 386--405."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"ACSAC '13: Annual Computer Security Applications Conference","location":"New Orleans Louisiana USA","acronym":"ACSAC '13","sponsor":["ACSA Applied Computing Security Assoc"]},"container-title":["Proceedings of the 29th Annual Computer Security Applications Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2523649.2523681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2523649.2523681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:03Z","timestamp":1750232043000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2523649.2523681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,9]]},"references-count":23,"alternative-id":["10.1145\/2523649.2523681","10.1145\/2523649"],"URL":"https:\/\/doi.org\/10.1145\/2523649.2523681","relation":{},"subject":[],"published":{"date-parts":[[2013,12,9]]},"assertion":[{"value":"2013-12-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}