{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:06:57Z","timestamp":1772726817807,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,11,22]],"date-time":"2026-11-22T00:00:00Z","timestamp":1795305600000},"content-version":"vor","delay-in-days":368,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ARPA-H","award":["SP4701-23-C-007"],"award-info":[{"award-number":["SP4701-23-C-007"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2451972, 2213057"],"award-info":[{"award-number":["2451972, 2213057"]}],"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":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765108","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:32:38Z","timestamp":1763854358000},"page":"1784-1798","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["PULSE: Parallel Private Set Union for Large-Scale Entities"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3821-2263","authenticated-orcid":false,"given":"Jiahui","family":"Gao","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9637-7624","authenticated-orcid":false,"given":"Son","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9934-2700","authenticated-orcid":false,"given":"Marina","family":"Blanton","sequence":"additional","affiliation":[{"name":"University at Buffalo, Buffalo, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6013-9512","authenticated-orcid":false,"given":"Ni","family":"Trieu","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_2_1","first-page":"301","volume-title":"PSU and Volume-Hiding Multi-Maps. In 32nd USENIX Security Symposium (USENIX Security 23)","author":"Bienstock Alexander","year":"2023","unstructured":"Alexander Bienstock, Sarvar Patel, Joon Young Seo, and Kevin Yeo. 2023. Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps. In 32nd USENIX Security Symposium (USENIX Security 23). USENIX Association, Anaheim, CA, 301-318. https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/bienstock"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054129"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_13"},{"key":"e_1_3_2_1_6_1","unstructured":"Prasad Buddhavarapu Andrew Knox Payman Mohassel Shubho Sengupta Erik Taubeneck and Vlad Vlaskin. 2020. Private Matching for Compute. Cryptology ePrint Archive Paper 2020\/599. https:\/\/eprint.iacr.org\/2020\/599 https:\/\/eprint.iacr.org\/2020\/599."},{"key":"e_1_3_2_1_7_1","volume-title":"SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics. In 19th USENIX Security Symposium (USENIX Security 10)","author":"Burkhart Martin","year":"2010","unstructured":"Martin Burkhart, Mario Strasser, Dilip Many, and Xenofontas Dimitropoulos. 2010. SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics. In 19th USENIX Security Symposium (USENIX Security 10). USENIX Association, Washington, DC. https:\/\/www.usenix.org\/conference\/usenixsecurity10\/sepia-privacy-preserving-aggregation-multi-domain-network-events-and"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Gowri R Chandran Thomas Schneider Maximilian Stillger and Christian Weinert. 2024. Concretely Efficient Private Set Union via Circuit-based PSI. Cryptology ePrint Archive Paper 2024\/1494. doi:10.1145\/3708821.3710839","DOI":"10.1145\/3708821.3710839"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484591"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Peter Rindal Mike Rosulek and Ni Trieu. 2018. PIR-PSI: Scaling Private Contact Discovery. Cryptology ePrint Archive Paper 2018\/579. https:\/\/eprint.iacr.org\/2018\/579 https:\/\/eprint.iacr.org\/2018\/579.","DOI":"10.1515\/popets-2018-0037"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Minglang Dong Yu Chen Cong Zhang Yujie Bai and Yang Cao. 2025a. Multi-Party Private Set Operations from Predicative Zero-Sharing. Cryptology ePrint Archive Paper 2025\/640. https:\/\/eprint.iacr.org\/2025\/640","DOI":"10.1145\/3719027.3765234"},{"key":"e_1_3_2_1_12_1","volume-title":"Efficient Multi-Party Private Set Union Without Non-Collusion Assumptions. In 34th USENIX Security Symposium (USENIX Security 25)","author":"Dong Minglang","year":"2025","unstructured":"Minglang Dong, Cong Zhang, Yujie Bai, and Yu Chen. 2025b. Efficient Multi-Party Private Set Union Without Non-Collusion Assumptions. In 34th USENIX Security Symposium (USENIX Security 25). USENIX Association, Seattle, WA. https:\/\/www.usenix.org\/conference\/usenixsecurity25\/presentation\/dong-minglang"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24141"},{"key":"e_1_3_2_1_14_1","volume-title":"PULSE: Parallel Private Set Union for Large-Scale Entities. Cryptology ePrint Archive, Paper 2025\/790. https:\/\/eprint.iacr.org\/2025\/790","author":"Gao Jiahui","year":"2025","unstructured":"Jiahui Gao, Son Nguyen, Marina Blanton, and Ni Trieu. 2025. PULSE: Parallel Private Set Union for Large-Scale Entities. Cryptology ePrint Archive, Paper 2025\/790. https:\/\/eprint.iacr.org\/2025\/790"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0133"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Gayathri Garimella Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2021b. Oblivious Key-Value Stores and Amplification for Private Set Intersection (LNCS ). 395-425. doi:10.1007\/978-3-030-84245-1_14","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_19_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2009. Foundations of Cryptography: Volume 2, Basic Applications (1st ed.). Cambridge University Press, USA."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Kyle Hogan Noah Luther Nabil Schear Emily Shen David Stott Sophia Yakoubov and Arkady Yerukhimovich. 2016. Secure Multiparty Computation for Cooperative Cyber Risk Assessment. In 2016 IEEE Cybersecurity Development (SecDev). 75-76. doi:10.1109\/SecDev.2016.028","DOI":"10.1109\/SecDev.2016.028"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_23_1","first-page":"2947","volume-title":"Shuffle-based Private Set Union: Faster and More Secure. In 31st USENIX Security Symposium (USENIX Security 22)","author":"Jia Yanxue","year":"2022","unstructured":"Yanxue Jia, Shi-Feng Sun, Hong-Sheng Zhou, Jiajun Du, and Dawu Gu. 2022. Shuffle-based Private Set Union: Faster and More Secure. In 31st USENIX Security Symposium (USENIX Security 22). USENIX Association, Boston, MA, 2947-2964. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/jia"},{"key":"e_1_3_2_1_24_1","unstructured":"Yanxue Jia Shi-Feng Sun Hong-Sheng Zhou and Dawu Gu. 2024. Scalable Private Set Union with Stronger Security. Cryptology ePrint Archive Paper 2024\/922. https:\/\/eprint.iacr.org\/2024\/922"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"e_1_3_2_1_26_1","volume-title":"Hyung Tae Lee, and Yongha Son","author":"Kim Jiseung","year":"2024","unstructured":"Jiseung Kim, Hyung Tae Lee, and Yongha Son. 2024. Revisiting Shuffle-Based Private Set Unions with Reduced Communication. Cryptology ePrint Archive, Paper 2024\/1560. https:\/\/eprint.iacr.org\/2024\/1560"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_23"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Tancr\u00e8de Lepoint Sarvar Patel Mariana Raykova Karn Seth and Ni Trieu. 2021. Private Join and Compute from PIR with Default (LNCS ). 605-634. doi:10.1007\/978-3-030-92075-3_21","DOI":"10.1007\/978-3-030-92075-3_21"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/10666"},{"key":"e_1_3_2_1_30_1","unstructured":"Yehuda Lindell. 2016. How To Simulate It - A Tutorial on the Simulation Proof Technique. Cryptology ePrint Archive Paper 2016\/046. https:\/\/eprint.iacr.org\/2016\/046"},{"key":"e_1_3_2_1_31_1","unstructured":"Qiang Liu and Joon-Woo Lee. 2024. Efficient Multi-party Private Set Union Resistant to Maximum Collusion Attacks. Cryptology ePrint Archive Paper 2024\/2096. https:\/\/eprint.iacr.org\/2024\/2096"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Xiang Liu and Ying Gao. 2023. Scalable Multi-party Private Set Union from Multi-query Secret-Shared Private Membership Test (LNCS ). 237-271. doi:10.1007\/978-981-99-8721-4_8","DOI":"10.1007\/978-981-99-8721-4_8"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_3"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372224.3419188"},{"key":"e_1_3_2_1_35_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015. Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security 2015, Jaeyeon Jung and Thorsten Holz (Eds.). USENIX Association, 515-530."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_3_2_1_39_1","unstructured":"Michael O. Rabin. 2005. How To Exchange Secrets with Oblivious Transfer. Cryptology ePrint Archive Paper 2005\/187. https:\/\/eprint.iacr.org\/2005\/187"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"e_1_3_2_1_41_1","unstructured":"Peter Rindal and Lance Roy. [n.d.]. libOTe: an efficient portable and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe."},{"key":"e_1_3_2_1_42_1","unstructured":"Zhusheng Wang and Sennur Ulukus. 2023. Private Federated Submodel Learning via Private Set Union. arXiv:2301.07686 [cs.CR] https:\/\/arxiv.org\/abs\/2301.07686"},{"key":"e_1_3_2_1_43_1","first-page":"337","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Zhang Cong","year":"2023","unstructured":"Cong Zhang, Yu Chen, Weiran Liu, Min Zhang, and Dongdai Lin. 2023. Linear Private Set Union from Multi-Query Reverse Private Membership Test. In 32nd USENIX Security Symposium (USENIX Security 23). USENIX Association, Anaheim, CA, 337-354. https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/zhang-cong"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765108","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:15:00Z","timestamp":1766441700000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":43,"alternative-id":["10.1145\/3719027.3765108","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765108","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}