{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T17:52:01Z","timestamp":1791913921868,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3423358","type":"proceedings-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T11:21:21Z","timestamp":1614856881000},"page":"1271-1287","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Fast Database Joins and PSI for Secret Shared Data"],"prefix":"10.1145","author":[{"given":"Payman","family":"Mohassel","sequence":"first","affiliation":[{"name":"Facebook, Menlo Park, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[{"name":"Visa Research, San Francisco, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mike","family":"Rosulek","sequence":"additional","affiliation":[{"name":"Oregon State University, Corcalis, OR, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_2_2_1","unstructured":"Alienvault open threat exchange (otx). 2018.  Alienvault open threat exchange (otx). 2018."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"e_1_3_2_2_4_1","unstructured":"Amazon web services. 2018.  Amazon web services. 2018."},{"key":"e_1_3_2_2_5_1","first-page":"40","volume-title":"Private and oblivious set and multiset operations","author":"Blanton Marina","year":"2012"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055334"},{"key":"e_1_3_2_2_7_1","first-page":"259","volume-title":"14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017","author":"Corrigan-Gibbs Henry","year":"2017"},{"key":"e_1_3_2_2_8_1","first-page":"218","volume-title":"11th International Conference, CANS 2012, Darmstadt, Germany, December 12--14, 2012. Proceedings","volume":"7712","author":"Cristofaro Emiliano De","year":"2012"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_2_11_1","volume-title":"Proceedings on Privacy Enhancing Technologies","author":"Demmler Daniel","year":"2018"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28641-4_13"},{"key":"e_1_3_2_2_13_1","volume-title":"inc","author":"Electronic","year":"2018"},{"key":"e_1_3_2_2_14_1","volume-title":"Crypten: A research tool for secure machine learning in pytorch","year":"2020"},{"key":"e_1_3_2_2_15_1","volume-title":"Aws data transfer costs and how to minimize them","year":"2017"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_2_2_18_1","first-page":"145","volume-title":"Extending oblivious transfers efficiently","author":"Ishai Yuval","year":"2003"},{"key":"e_1_3_2_2_19_1","first-page":"818","volume-title":"Efficient batched oblivious PRF with applications to private set intersection","author":"Kolesnikov Vladimir","year":"2016"},{"issue":"4","key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1515\/popets-2017-0044","article-title":"Private set intersection for unequal set sizes with mobile applications","volume":"2017","author":"Kiss \u00c1gnes","year":"2017","journal-title":"PoPETs"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_6"},{"key":"e_1_3_2_2_23_1","volume-title":"Tf encrypted: Encrypted deep learning in tensorflow","author":"al Morten Dahl Yann Dupis","year":"2020"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2423651.2423652"},{"key":"e_1_3_2_2_26_1","volume-title":"ABY3: A mixed protocol framework for machine learning. IACR Cryptology ePrint Archive","author":"Mohassel Payman","year":"2018"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"e_1_3_2_2_28_1","volume-title":"How to break anonymity of the netflix prize dataset. CoRR, abs\/cs\/0610105","author":"Narayanan Arvind","year":"2006"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SARNOF.2016.7846734"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"e_1_3_2_2_31_1","first-page":"515","volume-title":"Phasing: Private set intersection using permutation-based hashing","author":"Pinkas Benny","year":"2015"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_2_33_1","first-page":"797","volume-title":"23rd USENIX Security Symposium (USENIX Security 14)","author":"Pinkas Benny","year":"2014"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-58387-6_11"},{"key":"e_1_3_2_2_36_1","volume-title":"Testing privacy-preserving telemetry with prio","author":"Robert Helmer Eric Rescorla","year":"2018"},{"key":"e_1_3_2_2_37_1","unstructured":"Peter Rindal. libOTe: an efficient portable and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe.  Peter Rindal. libOTe: an efficient portable and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe."},{"key":"e_1_3_2_2_38_1","first-page":"1501","volume-title":"XONN: xnor-based oblivious deep neural network inference","author":"Riazi M. Sadegh","year":"2019"},{"key":"e_1_3_2_2_39_1","volume-title":"6 new facts about facebook","author":"Smith Aaron","year":"2014"},{"key":"e_1_3_2_2_40_1","unstructured":"Facebook threat exchange. 2018.  Facebook threat exchange. 2018."},{"issue":"3","key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2478\/popets-2019-0035","article-title":"3-party secure computation for neural network training","volume":"2019","author":"Wagh Sameer","year":"2019","journal-title":"PoPETs"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3201586"}],"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 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3423358","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3423358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:02:20Z","timestamp":1750183340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3423358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":40,"alternative-id":["10.1145\/3372297.3423358","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3423358","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}