{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:30:40Z","timestamp":1784676640682,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,25]]},"DOI":"10.1145\/3708821.3710839","type":"proceedings-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T06:30:56Z","timestamp":1755066656000},"page":"149-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Concretely Efficient Private Set Union via Circuit-Based PSI"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3189-8066","authenticated-orcid":false,"given":"Gowri R","family":"Chandran","sequence":"first","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8090-1316","authenticated-orcid":false,"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9979-7790","authenticated-orcid":false,"given":"Maximilian","family":"Stillger","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4906-6871","authenticated-orcid":false,"given":"Christian","family":"Weinert","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,8,24]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Bruno Beauquier and \u00c9ric Darrot. 2002. On Arbitrary Size Waksman Networks and Their Vulnerability. Parallel Process. Lett. (2002).","DOI":"10.1142\/S0129626402000999"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_8"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"V.\u00a0E. Bene\u0161. 1964. Optimal rearrangeable multistage connecting networks. The Bell System Technical Journal (1964).","DOI":"10.1002\/j.1538-7305.1964.tb04103.x"},{"key":"e_1_3_3_2_6_2","volume-title":"USENIX Security Symposium","author":"Bienstock Alexander","year":"2023","unstructured":"Alexander Bienstock, Sarvar Patel, Joon\u00a0Young Seo, and Kevin Yeo. 2023. Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps. In USENIX Security Symposium."},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414479"},{"key":"e_1_3_3_2_8_2","volume-title":"CCS","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl. 2019. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In CCS."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Nishanth Chandran Divya Gupta and Akash Shah. 2022. Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF. PoPETs.","DOI":"10.2478\/popets-2022-0018"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-57725-3_13"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59870-3_15"},{"key":"e_1_3_3_2_17_2","unstructured":"Minglang Dong Yu Chen Cong Zhang and Yujie Bai. 2024. Breaking Free: Efficient Multi-Party Private Set Union Without Non-Collusion Assumptions. CoRR (2024)."},{"key":"e_1_3_3_2_18_2","unstructured":"Jean-Guillaume Dumas Alexis Galan Bruno Grenet Aude Maignan and Daniel\u00a0S. Roche. 2024. Communication Optimal Unbalanced Private Set Union. CoRR abs\/2402.16393 (2024)."},{"key":"e_1_3_3_2_19_2","unstructured":"Michael\u00a0J. Freedman Carmit Hazay Kobbi Nissim and Benny Pinkas. 2016. Efficient Set Intersection with Simulation-Based Security. J. Cryptol. (2016)."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_16"},{"key":"e_1_3_3_2_21_2","unstructured":"Jiahui Gao Son Nguyen and Ni Trieu. 2023. Toward A Practical Multi-party Private Set Union. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_3_2_24_2","volume-title":"STOC","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC."},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"e_1_3_3_2_26_2","volume-title":"NDSS","author":"Huang Yan","year":"2012","unstructured":"Yan Huang, David Evans, and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In NDSS."},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_3_2_28_2","volume-title":"USENIX Security Symposium","author":"Jia Yanxue","year":"2022","unstructured":"Yanxue Jia, Shifeng Sun, Hong-Sheng Zhou, Jiajun Du, and Dawu Gu. 2022. Shuffle-based Private Set Union: Faster and More Secure. In USENIX Security Symposium."},{"key":"e_1_3_3_2_29_2","volume-title":"USENIX Security Symposium","author":"Jia Yanxue","year":"2024","unstructured":"Yanxue Jia, Shi-Feng Sun, Hong-Sheng Zhou, and Dawu Gu. 2024. Scalable Private Set Union, with Stronger Security. In USENIX Security Symposium."},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_23"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70890-9_17"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8721-4_8"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/647911.740481"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Stanislav Peceny Srinivasan Raghuraman Peter Rindal and Harshal Shah. 2024. Efficient Permutation Correlations and Batched Random Access for Two-Party Computation. Cryptology ePrint Archive (2024).","DOI":"10.1007\/978-3-031-91829-2_3"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_3_2_38_2","volume-title":"USENIX Security Symposium","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 Symposium."},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_3_2_41_2","volume-title":"USENIX Security Symposium","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX Security Symposium."},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Thomas Schneider and Michael Zohner. 2018. Scalable Private Set Intersection Based on OT Extension. ACM Trans. Priv. Secur. (2018).","DOI":"10.1145\/3154794"},{"key":"e_1_3_3_2_43_2","unstructured":"Michael\u00a0O. Rabin. 1981. How To Exchange Secrets with Oblivious Transfer. Technical Report TR-81 Aiken Computation Laboratory Harvard University (1981)."},{"key":"e_1_3_3_2_44_2","volume-title":"CCS","author":"Raghuraman Srinivasan","year":"2022","unstructured":"Srinivasan Raghuraman and Peter Rindal. 2022. Blazing Fast PSI from Improved OKVS and Subfield VOLE. In CCS."},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_3_2_47_2","volume-title":"CCS","author":"Tu Binbin","year":"2023","unstructured":"Binbin Tu, Yu Chen, Qi Liu, and Cong Zhang. 2023. Fast Unbalanced Private Set Union from Fully Homomorphic Encryption. In CCS."},{"key":"e_1_3_3_2_48_2","doi-asserted-by":"crossref","unstructured":"Abraham Waksman. 1968. A Permutation Network. J. ACM (1968).","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_3_2_49_2","doi-asserted-by":"crossref","unstructured":"Yaxi Yang Xiaojian Liang Xiangfu Song Linting Huang Hongyu Ren Changyu Dong and Jianying Zhou. 2025. Maliciously Secure Circuit-PSI via SPDZ-Compatible Oblivious PRF. PoPETs.","DOI":"10.56553\/popets-2025-0082"},{"key":"e_1_3_3_2_50_2","volume-title":"FOCS","author":"Yao Andrew\u00a0Chi-Chih","year":"1986","unstructured":"Andrew\u00a0Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In FOCS."},{"key":"e_1_3_3_2_51_2","volume-title":"USENIX Security Symposium","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 USENIX Security Symposium."}],"event":{"name":"ASIA CCS '25: 20th ACM Asia Conference on Computer and Communications Security","location":"Hanoi Vietnam","acronym":"ASIA CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 20th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3708821.3710839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T07:29:46Z","timestamp":1755070186000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3708821.3710839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,24]]},"references-count":50,"alternative-id":["10.1145\/3708821.3710839","10.1145\/3708821"],"URL":"https:\/\/doi.org\/10.1145\/3708821.3710839","relation":{},"subject":[],"published":{"date-parts":[[2025,8,24]]},"assertion":[{"value":"2025-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}