{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:51:01Z","timestamp":1768827061435,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,7]],"date-time":"2015-06-07T00:00:00Z","timestamp":1433635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["609611"],"award-info":[{"award-number":["609611"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1059416"],"award-info":[{"award-number":["CNS-1059416"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["ARO-STIR-W911NF-14-1-0456"],"award-info":[{"award-number":["ARO-STIR-W911NF-14-1-0456"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["ONR-R17460"],"award-info":[{"award-number":["ONR-R17460"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,7]]},"DOI":"10.1145\/2744769.2744808","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Compacting privacy-preserving k-nearest neighbor search using logic synthesis"],"prefix":"10.1145","author":[{"given":"Ebrahim M.","family":"Songhori","sequence":"first","affiliation":[{"name":"Rice University, Houston, TX"}]},{"given":"Siam U.","family":"Hussain","sequence":"additional","affiliation":[{"name":"Rice University, Houston, TX"}]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t, Darmstadt, Germany"}]},{"given":"Farinaz","family":"Koushanfar","sequence":"additional","affiliation":[{"name":"Rice University, Houston, TX"}]}],"member":"320","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_16"},{"key":"e_1_3_2_1_4_1","unstructured":"Brenner perl and Smith. hcrypt Secure Function Evaluation (SFE) project. https:\/\/hcrypt.com\/sfe\/.  Brenner perl and Smith. hcrypt Secure Function Evaluation (SFE) project. https:\/\/hcrypt.com\/sfe\/."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2664243.2664255"},{"key":"e_1_3_2_1_6_1","volume-title":"USENIX Security. USENIX","author":"Carter H.","year":"2013","unstructured":"H. Carter , B. Mood , P. Traynor , and K. Butler . Secure outsourced garbled circuit evaluation for mobile phones . In USENIX Security. USENIX , 2013 . H. Carter, B. Mood, P. Traynor, and K. Butler. Secure outsourced garbled circuit evaluation for mobile phones. In USENIX Security. USENIX, 2013."},{"key":"e_1_3_2_1_7_1","volume-title":"USENIX Security. USENIX","author":"Demmler D.","year":"2014","unstructured":"D. Demmler , T. Schneider , and M. Zohner . Ad-hoc secure two-party computation on mobile devices using hardware tokens . In USENIX Security. USENIX , 2014 . D. Demmler, T. Schneider, and M. Zohner. Ad-hoc secure two-party computation on mobile devices using hardware tokens. In USENIX Security. USENIX, 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484369"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_1_12_1","volume-title":"HotSec. USENIX","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , P. Chapman , and D. Evans . Privacy-preserving applications on smartphones . In HotSec. USENIX , 2011 . Y. Huang, P. Chapman, and D. Evans. Privacy-preserving applications on smartphones. In HotSec. USENIX, 2011."},{"key":"e_1_3_2_1_13_1","volume-title":"Network and Distributed Security Symposium (NDSS)","author":"Huang Y.","year":"2012","unstructured":"Y. Huang , D. Evans , and J. Katz . Private set intersection: Are garbled circuits better than custom protocols ? In Network and Distributed Security Symposium (NDSS) , 2012 . Y. Huang, D. Evans, and J. Katz. Private set intersection: Are garbled circuits better than custom protocols? In Network and Distributed Security Symposium (NDSS), 2012."},{"key":"e_1_3_2_1_14_1","volume-title":"USENIX Security. USENIX","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , D. Evans , J. Katz , and L. Malka . Faster secure two-party computation using garbled circuits . In USENIX Security. USENIX , 2011 . Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security. USENIX, 2011."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523649.2523681"},{"key":"e_1_3_2_1_16_1","volume-title":"Garbled circuits for leakage-resilience: Hardware implementation and evaluation of one-time programs","author":"J\u00e4rvinen K.","year":"2010","unstructured":"K. J\u00e4rvinen , V. Kolesnikov , A. Sadeghi , and T. Schneider . Garbled circuits for leakage-resilience: Hardware implementation and evaluation of one-time programs . In CHES. Springer , 2010 . K. J\u00e4rvinen, V. Kolesnikov, A. Sadeghi, and T. Schneider. Garbled circuits for leakage-resilience: Hardware implementation and evaluation of one-time programs. In CHES. Springer, 2010."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_19_1","volume-title":"USENIX Security","author":"Kreuter B.","year":"2013","unstructured":"B. Kreuter , A. Shelat , B. Mood , and K. RB Butler . PCF : A portable circuit format for scalable two-party secure computation . In USENIX Security , 2013 . B. Kreuter, A. Shelat, B. Mood, and K. RB Butler. PCF: A portable circuit format for scalable two-party secure computation. In USENIX Security, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.704129"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046787"},{"key":"e_1_3_2_1_23_1","volume-title":"USENIX Security. ACM","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella . Fairplay -- a secure two-party computation system . In USENIX Security. ACM , 2004 . D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay -- a secure two-party computation system. In USENIX Security. ACM, 2004."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_19"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0102-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_27_1","volume-title":"Computing privacy-preserving edit distance and Smith-Waterman problems on the GPU architecture","author":"Pu S.","year":"2013","unstructured":"S. Pu and J. Liu . Computing privacy-preserving edit distance and Smith-Waterman problems on the GPU architecture , 2013 . S. Pu and J. Liu. Computing privacy-preserving edit distance and Smith-Waterman problems on the GPU architecture, 2013."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.79"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.133"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"e_1_3_2_1_31_1","volume-title":"NIPS","author":"Weiss Y.","year":"2009","unstructured":"Y. Weiss , A. Torralba , and R. Fergus . Spectral hashing . In NIPS , 2009 . Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, 2009."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"DAC '15: The 52nd Annual Design Automation Conference 2015","location":"San Francisco California","acronym":"DAC '15","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 52nd Annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2744769.2744808","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2744769.2744808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:02Z","timestamp":1750227122000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2744769.2744808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,7]]},"references-count":32,"alternative-id":["10.1145\/2744769.2744808","10.1145\/2744769"],"URL":"https:\/\/doi.org\/10.1145\/2744769.2744808","relation":{},"subject":[],"published":{"date-parts":[[2015,6,7]]},"assertion":[{"value":"2015-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}