{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:05:50Z","timestamp":1773795950618,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","funder":[{"name":"HKU-SCF FinTech Academy"},{"name":"Shenzhen-Hong Kong-Macao Science and Technology Plan Project (Category C)","award":["SGDX20210823103537030"],"award-info":[{"award-number":["SGDX20210823103537030"]}]},{"name":"Theme-based Research Scheme","award":["T35-710\/20-R"],"award-info":[{"award-number":["T35-710\/20-R"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,25]]},"DOI":"10.1145\/3708821.3733886","type":"proceedings-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T06:30:56Z","timestamp":1755066656000},"page":"104-117","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Private Set Intersection by Utilizing Oblivious Transfer Extension"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-5629-061X","authenticated-orcid":false,"given":"Mingli","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0629-6792","authenticated-orcid":false,"given":"Tsz Hon","family":"Yuen","sequence":"additional","affiliation":[{"name":"Department of Software Systems and Cybersecurity, Monash University, Clayton, Victoria, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3975-8500","authenticated-orcid":false,"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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-642-19379-8_10"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_3_2_11_2","first-page":"14","volume-title":"WPES@CCS 2019","author":"Falk Brett\u00a0Hemenway","year":"2019","unstructured":"Brett\u00a0Hemenway Falk, Daniel Noble, and Rafail Ostrovsky. 2019. Private Set Intersection with Linear Communication from General Assumptions. In WPES@CCS 2019, Lorenzo Cavallaro, Johannes Kinder, and Josep Domingo-Ferrer (Eds.). ACM, 14\u201325."},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_6"},{"key":"e_1_3_3_2_15_2","volume-title":"NDSS 2012","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 2012. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2012\/private-set-intersection-are-garbled-circuits-better-custom-protocols"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"e_1_3_3_2_19_2","first-page":"1447","volume-title":"USENIX Security 2019","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, Nadia Heninger and Patrick Traynor (Eds.). USENIX Association, 1447\u20131464."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"e_1_3_3_2_23_2","unstructured":"Mikkel Lamb\u00e6k. 2016. Breaking and Fixing Private Set Intersection Protocols. IACR Cryptol. ePrint Arch. (2016) 665. http:\/\/eprint.iacr.org\/2016\/665"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_3_2_25_2","first-page":"95","volume-title":"USENIX Security 2010","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. USENIX Association, 95\u2013110."},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_3_2_29_2","first-page":"515","volume-title":"USENIX Security 2015","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\u2013530."},{"key":"e_1_3_3_2_30_2","first-page":"797","volume-title":"USENIX Security 2014","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 2014, Kevin Fu and Jaeyeon Jung (Eds.). USENIX Association, 797\u2013812."},{"key":"e_1_3_3_2_31_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. 21 2 (2018) 7:1\u20137:35.","DOI":"10.1145\/3154794"},{"key":"e_1_3_3_2_32_2","unstructured":"Michael\u00a0O. Rabin. 2005. How To Exchange Secrets with Oblivious Transfer. IACR Cryptol. ePrint Arch. (2005) 187. http:\/\/eprint.iacr.org\/2005\/187"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484778"},{"key":"e_1_3_3_2_38_2","first-page":"283","volume-title":"USENIX Security 2023","author":"Wu Mingli","year":"2023","unstructured":"Mingli Wu and Tsz\u00a0Hon Yuen. 2023. Efficient Unbalanced Private Set Intersection Cardinality and User-friendly Privacy-preserving Contact Tracing. In USENIX Security 2023, Joseph\u00a0A. Calandrino and Carmela Troncoso (Eds.). USENIX Association, 283\u2013300."},{"key":"e_1_3_3_2_39_2","first-page":"6489","volume-title":"USENIX Security 2024","author":"Wu Mingli","year":"2024","unstructured":"Mingli Wu, Tsz\u00a0Hon Yuen, and Kwan\u00a0Yin Chan. 2024. O-Ring and K-Star: Efficient Multi-party Private Set Intersection. In USENIX Security 2024, Davide Balzarotti and Wenyuan Xu (Eds.). USENIX Association, 6489\u20136506."},{"key":"e_1_3_3_2_40_2","first-page":"162","volume-title":"27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986","author":"Yao Andrew\u00a0Chi-Chih","year":"1986","unstructured":"Andrew\u00a0Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986. IEEE Computer Society, 162\u2013167."}],"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.3733886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T07:24:55Z","timestamp":1755069895000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3708821.3733886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,24]]},"references-count":39,"alternative-id":["10.1145\/3708821.3733886","10.1145\/3708821"],"URL":"https:\/\/doi.org\/10.1145\/3708821.3733886","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"}}]}}