{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:34:25Z","timestamp":1783791265110,"version":"3.55.0"},"reference-count":59,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-009"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-001"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/eurosp48549.2020.00031","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T16:58:11Z","timestamp":1604336291000},"page":"370-389","source":"Crossref","is-referenced-by-count":108,"title":["On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality"],"prefix":"10.1109","author":[{"given":"Mihaela","family":"Ion","sequence":"first","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Kreuter","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmet Erhan","family":"Nergiz","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarvar","family":"Patel","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shobhit","family":"Saxena","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karn","family":"Seth","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Shanahan","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[{"name":"Google LLC"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"259","article-title":"Prio: Private, robust, and scalable computation of aggregate statistics","author":"corrigan-gibbs","year":"0","journal-title":"14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17)"},{"key":"ref57","article-title":"Catching bandits and only bandits: Privacy-preserving intersection warrants for lawful surveillance","author":"segal","year":"2014","journal-title":"FOCI"},{"key":"ref56","article-title":"Improved private set intersection against malicious adversaries","author":"rindal","year":"2016","journal-title":"Tech Rep"},{"key":"ref12","first-page":"464","article-title":"Combining private set-intersection with secure two-party computation","author":"ciampi","year":"0","journal-title":"International Conference on Security and Cryptography for Networks"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref14","first-page":"218","article-title":"Fast and private computation of cardinality of set intersection and union","volume":"7712","author":"cristofaro","year":"2012","journal-title":"CANS"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2005-13401"},{"key":"ref53","first-page":"797","article-title":"Faster private set intersection based on ot extension","volume":"14","author":"pinkas","year":"2014","journal-title":"Usenix Security"},{"key":"ref52","first-page":"125","article-title":"Efficient circuit-based psi via cuckoo hashing","author":"pinkas","year":"0","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref55","first-page":"49:1","article-title":"Callisto: A cryptographic approach to detecting serial perpetrators of sexual misconduct","author":"rajan","year":"2018","journal-title":"COMPASS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9"},{"key":"ref16","first-page":"125","article-title":"Efficient robust private set intersection","author":"dachman-soled","year":"0","journal-title":"International Conference on Applied Cryptography and Network Security"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0037"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref50","first-page":"515","article-title":"Phasing: private set intersection using permutation-based hashing","author":"pinkas","year":"0","journal-title":"Proceedings of the 24th USENIX Conference on Security Symposium"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref45","first-page":"21","article-title":"Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security","author":"narayanan","year":"0","journal-title":"Conference on Cryptology and Network Security"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","article-title":"SpOT-light: Lightweight private set intersection from sparse OT extension","volume":"11694","author":"pinkas","year":"2019","journal-title":"CRYPTO (3) Lecture Notes in Computer Science"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3345661"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972643"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref40","article-title":"Secure multi-party computation for analytics deployed as a lightweight web application","author":"lapets","year":"2016","journal-title":"Computer Science Department Boston University Technical Report"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"ref31","author":"hellman","year":"1984","journal-title":"Exponentiation cryptographic apparatus and method"},{"key":"ref30","first-page":"465","article-title":"Fully homomorphic encryption with polylog overhead","author":"gentry","year":"0","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref33","author":"huang","year":"2012","journal-title":"Private set intersection Are garbled circuits better than custom protocols? In NDSS"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3338498.3358645"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872771"},{"key":"ref1","year":"0","journal-title":"On deploying secure computing Private intersection-sum-with-cardinality [full version]"},{"key":"ref39","author":"lambrek","year":"2016","journal-title":"Breaking and fixing private set intersection protocols Tech rep Cryptology ePrint Archive Report 2016\/665"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19962-7_24"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"ref25","article-title":"Somewhat practical fully homomorphic encryption","volume":"2012","author":"fan","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref22","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Theory of Cryptography"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0047"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref29","author":"furukawa","year":"2017","journal-title":"High-throughput secure three-party computation for malicious adversaries and an honest majority"}],"event":{"name":"2020 IEEE European Symposium on Security and Privacy (EuroS&P)","location":"Genoa, Italy","start":{"date-parts":[[2020,9,7]]},"end":{"date-parts":[[2020,9,11]]}},"container-title":["2020 IEEE European Symposium on Security and Privacy (EuroS&P)"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/9229479\/9230353\/09230369.pdf?arnumber=9230369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T18:25:05Z","timestamp":1699467905000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/9230369\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":59,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/eurosp48549.2020.00031","relation":{},"subject":[],"published":{"date-parts":[[2020,9]]}}}