{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T16:55:31Z","timestamp":1786812931532,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["#2236819"],"award-info":[{"award-number":["#2236819"]}]},{"name":"Google Research Awards"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690349","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"1478-1492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Actively Secure Private Set Intersection in the Client-Server Setting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1724-9614","authenticated-orcid":false,"given":"Yunqing","family":"Sun","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"Google LLC & University of Maryland, Washington DC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1744-4025","authenticated-orcid":false,"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Google LLC, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7951-3930","authenticated-orcid":false,"given":"Phillipp","family":"Schoppmann","sequence":"additional","affiliation":[{"name":"Google LLC, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5991-7417","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"PKC","author":"Albrecht Martin R.","year":"2021","unstructured":"Martin R. Albrecht, Alex Davidson, Amit Deo, and Nigel P. Smart. 2021. Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices. In PKC 2021, Part II (LNCS, Vol. 12711)."},{"key":"e_1_3_2_1_2_1","unstructured":"D. F. Aranha C. P. L. Gouv\u00eaa T. Markmann R. S. Wahby and K. Liao. [n. d.]. RELIC is an Efficient Library for Cryptography. https:\/\/github.com\/relic-toolkit\/relic."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-53368-6_8"},{"key":"e_1_3_2_1_5_1","volume-title":"Verifiable Private Information Retrieval. In TCC","author":"Ben-David Shany","year":"2022","unstructured":"Shany Ben-David, Yael Tauman Kalai, and Omer Paneth. 2022. Verifiable Private Information Retrieval. In TCC 2022, Part III (LNCS, Vol. 13749)."},{"key":"e_1_3_2_1_6_1","volume-title":"Short Signatures Without Random Oracles. In EUROCRYPT 2004 (LNCS","author":"Boneh Dan","year":"2004","unstructured":"Dan Boneh and Xavier Boyen. 2004. Short Signatures Without Random Oracles. In EUROCRYPT 2004 (LNCS, Vol. 3027)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_18"},{"key":"e_1_3_2_1_8_1","volume-title":"The Wonderful World of Global Random Oracles. In EUROCRYPT","author":"Camenisch Jan","year":"2018","unstructured":"Jan Camenisch, Manu Drijvers, Tommaso Gagliardoni, Anja Lehmann, and Gregory Neven. 2018. The Wonderful World of Global Random Oracles. In EUROCRYPT 2018, Part I (LNCS, Vol. 10820)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"e_1_3_2_1_10_1","volume-title":"42nd FOCS","author":"Canetti Ran","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS. IEEE Computer Society Press."},{"key":"e_1_3_2_1_11_1","volume-title":"Threshold ECDSA with Identifiable Aborts. In ACM CCS","author":"Canetti Ran","year":"2020","unstructured":"Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, and Udi Peled. 2020. UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. In ACM CCS 2020."},{"key":"e_1_3_2_1_12_1","volume-title":"SoK: oblivious pseudorandom functions","author":"Casacuberta S\u00edlvia","unstructured":"S\u00edlvia Casacuberta, Julia Hesse, and Anja Lehmann. 2022. SoK: oblivious pseudorandom functions. In IEEE EuroS&P."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0026"},{"key":"e_1_3_2_1_18_1","volume-title":"USENIX Security","author":"de Castro Leo","year":"2024","unstructured":"Leo de Castro and Keewoo Lee. 2024. VeriSimplePIR: Verifiability in SimplePIR at No Online Cost for Honest Servers. In USENIX Security 2024."},{"key":"e_1_3_2_1_19_1","volume-title":"Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. In ASIACRYPT 2010 (LNCS","author":"Cristofaro Emiliano De","year":"2010","unstructured":"Emiliano De Cristofaro, Jihye Kim, and Gene Tsudik. 2010. Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. In ASIACRYPT 2010 (LNCS, Vol. 6477)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"e_1_3_2_1_21_1","volume-title":"2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press.","author":"Doerner Jack","unstructured":"Jack Doerner, Yashvanth Kondi, Eysa Lee, and abhi shelat. 2018. Secure Two-party Threshold ECDSA from ECDSA Assumptions. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press."},{"key":"e_1_3_2_1_22_1","volume-title":"2019 IEEE Symposium on Security and Privacy. IEEE Computer Society Press.","author":"Doerner Jack","unstructured":"Jack Doerner, Yashvanth Kondi, Eysa Lee, and abhi shelat. 2019. Threshold ECDSA from ECDSA Assumptions: The Multiparty Case. In 2019 IEEE Symposium on Security and Privacy. IEEE Computer Society Press."},{"key":"e_1_3_2_1_23_1","volume-title":"USENIX Security","author":"Everspaugh Adam","year":"2015","unstructured":"Adam Everspaugh, Rahul Chatterjee, Samuel Scott, Ari Juels, and Thomas Ristenpart. 2015. The Pythia PRF Service. In USENIX Security 2015."},{"key":"e_1_3_2_1_24_1","volume-title":"Fast Multiparty Threshold ECDSA with Fast Trustless Setup. In ACM CCS","author":"Gennaro Rosario","year":"2018","unstructured":"Rosario Gennaro and Steven Goldfeder. 2018. Fast Multiparty Threshold ECDSA with Fast Trustless Setup. In ACM CCS 2018."},{"key":"e_1_3_2_1_25_1","volume-title":"Two Party RSA Key Generation. In CRYPTO'99 (LNCS","author":"Gilboa Niv","year":"1999","unstructured":"Niv Gilboa. 1999. Two Party RSA Key Generation. In CRYPTO'99 (LNCS, Vol. 1666)."},{"key":"e_1_3_2_1_26_1","volume-title":"Highly Efficient OT-Based Multiplication Protocols. In EUROCRYPT","author":"Haitner Iftach","year":"2022","unstructured":"Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, and Eliad Tsfadia. 2022. Highly Efficient OT-Based Multiplication Protocols. In EUROCRYPT 2022, Part I (LNCS, Vol. 13275)."},{"key":"e_1_3_2_1_27_1","volume-title":"USENIX Security","author":"Henzinger Alexandra","year":"2023","unstructured":"Alexandra Henzinger, Matthew M. Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, and Vinod Vaikuntanathan. 2023. One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In USENIX Security 2023."},{"key":"e_1_3_2_1_28_1","volume-title":"Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, and Moti Yung.","author":"Ion Mihaela","year":"2020","unstructured":"Mihaela Ion, Ben Kreuter, Ahmet Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, and Moti Yung. 2020. On deploying secure computing: Private intersection-sum-with-cardinality. In EuroS&P. IEEE."},{"key":"e_1_3_2_1_29_1","volume-title":"Updatable Oblivious Key Management for Storage Systems. In ACM CCS","author":"Jarecki Stanislaw","year":"2019","unstructured":"Stanislaw Jarecki, Hugo Krawczyk, and Jason K. Resch. 2019. Updatable Oblivious Key Management for Storage Systems. In ACM CCS 2019."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki and Xiaomin Liu. 2010. Fast Secure Computation of Set Intersection. In SCN 10 (LNCS Vol. 6280).","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"e_1_3_2_1_31_1","volume-title":"USENIX Security","author":"Kales Daniel","year":"2019","unstructured":"Daniel Kales, Christian Rechberger, Thomas Schneider, Matthias Senker, and Christian Weinert. 2019. Mobile Private Contact Discovery at Scale. In USENIX Security 2019."},{"key":"e_1_3_2_1_32_1","volume-title":"Actively Secure OT Extension with Optimal Overhead. In CRYPTO","author":"Keller Marcel","year":"2015","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead. In CRYPTO 2015, Part I (LNCS, Vol. 9215)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"e_1_3_2_1_34_1","volume-title":"Anonymous Tokens with Private Metadata Bit. In CRYPTO","author":"Kreuter Ben","year":"2020","unstructured":"Ben Kreuter, Tancr\u00e8de Lepoint, Michele Orr\u00f9, and Mariana Raykova. 2020. Anonymous Tokens with Private Metadata Bit. In CRYPTO 2020, Part I (LNCS, Vol. 12170)."},{"key":"e_1_3_2_1_35_1","volume-title":"Protocols for Checking Compromised Credentials. In ACM CCS","author":"Li Lucy","year":"2019","unstructured":"Lucy Li, Bijeeta Pal, Junade Ali, Nick Sullivan, Rahul Chatterjee, and Thomas Ristenpart. 2019. Protocols for Checking Compromised Credentials. In ACM CCS 2019."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243788"},{"key":"e_1_3_2_1_37_1","volume-title":"Vadhan","author":"Micali Silvio","year":"1999","unstructured":"Silvio Micali, Michael O. Rabin, and Salil P. Vadhan. 1999. Verifiable Random Functions. In 40th FOCS. IEEE Computer Society Press."},{"key":"e_1_3_2_1_38_1","volume-title":"USENIX Security","author":"Nagaraja Shishir","year":"2010","unstructured":"Shishir Nagaraja, Prateek Mittal, Chi-Yao Hong, Matthew Caesar, and Nikita Borisov. 2010. BotGrep: Finding P2P Bots with Structured Graph Analysis. In USENIX Security 2010."},{"key":"e_1_3_2_1_39_1","volume-title":"Fast Malicious Multiparty Private Set Intersection. In ACM CCS","author":"Nevo Ofri","year":"2021","unstructured":"Ofri Nevo, Ni Trieu, and Avishay Yanai. 2021. Simple, Fast Malicious Multiparty Private Set Intersection. In ACM CCS 2021."},{"key":"e_1_3_2_1_40_1","volume-title":"Nick Sullivan, Luke Valenta, Tara Whalen, Christopher A. Wood, Thomas Ristenpart, and Rahul Chatterjee.","author":"Pal Bijeeta","year":"2022","unstructured":"Bijeeta Pal, Mazharul Islam, Marina Sanusi Bohuk, Nick Sullivan, Luke Valenta, Tara Whalen, Christopher A. Wood, Thomas Ristenpart, and Rahul Chatterjee. 2022. Might I Get Pwned: A Second Generation Compromised Credential Checking Service. In USENIX Security 2022."},{"key":"e_1_3_2_1_41_1","volume-title":"Malicious Private Set Intersection. In EUROCRYPT","author":"Pinkas Benny","year":"2020","unstructured":"Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2020. PSI from PaXoS: Fast, Malicious Private Set Intersection. In EUROCRYPT 2020, Part II (LNCS, Vol. 12106)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"e_1_3_2_1_43_1","volume-title":"Faster Unbalanced Private Set Intersection. In FC 2018 (LNCS","author":"Amanda","unstructured":"Amanda C. Davi Resende and Diego F. Aranha. 2018. Faster Unbalanced Private Set Intersection. In FC 2018 (LNCS, Vol. 10957)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_2_1_45_1","volume-title":"Compact and Malicious Private Set Intersection for Small Sets. In ACM CCS","author":"Rosulek Mike","year":"2021","unstructured":"Mike Rosulek and Ni Trieu. 2021. Compact and Malicious Private Set Intersection for Small Sets. In ACM CCS 2021."},{"key":"e_1_3_2_1_46_1","volume-title":"The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications. Applicable Algebra in Engineering, Communication and Computing","author":"Seres Istv\u00e1n Andr\u00e1s","year":"2023","unstructured":"Istv\u00e1n Andr\u00e1s Seres, M\u00e1t\u00e9 Horv\u00e1th, and P\u00e9ter Burcsi. 2023. The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications. Applicable Algebra in Engineering, Communication and Computing (2023)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_9"},{"key":"e_1_3_2_1_48_1","unstructured":"Yunqing Sun Jonathan Katz Mariana Raykova Phillipp Schoppmann and Xiao Wang. 2024. Actively Secure Private Set Intersection in the Client-Server Setting. Cryptology ePrint Archive Report 2024\/570. https:\/\/eprint.iacr.org\/2024\/570."},{"key":"e_1_3_2_1_49_1","volume-title":"EUROCRYPT","author":"Tyagi Nirvan","year":"2022","unstructured":"Nirvan Tyagi, Sof\u00eda Celi, Thomas Ristenpart, Nick Sullivan, Stefano Tessaro, and Christopher A. Wood. 2022. A Fast and Simple Partially Oblivious PRF, with Applications. In EUROCRYPT 2022, Part II (LNCS, Vol. 13276)."},{"key":"e_1_3_2_1_50_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_51_1","volume-title":"Efficient Online-friendly Two-Party ECDSA Signature. In ACM CCS","author":"Xue Haiyang","year":"2021","unstructured":"Haiyang Xue, Man Ho Au, Xiang Xie, Tsz Hon Yuen, and Handong Cui. 2021. Efficient Online-friendly Two-Party ECDSA Signature. In ACM CCS 2021."},{"key":"e_1_3_2_1_52_1","volume-title":"Ferret: Fast Extension for Correlated OT with Small Communication. In ACM CCS","author":"Yang Kang","year":"2020","unstructured":"Kang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang, and Xiao Wang. 2020. Ferret: Fast Extension for Correlated OT with Small Communication. In ACM CCS 2020."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690349","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:08:43Z","timestamp":1755842923000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":52,"alternative-id":["10.1145\/3658644.3690349","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690349","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}