{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T02:32:55Z","timestamp":1755225175409,"version":"3.43.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","funder":[{"name":"National Cryptologic Science Fund of China","award":["2025NCSF02023"],"award-info":[{"award-number":["2025NCSF02023"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,25]]},"DOI":"10.1145\/3708821.3736218","type":"proceedings-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T06:30:56Z","timestamp":1755066656000},"page":"136-148","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Server-Aided Multiparty Private Set Intersection from OKVS and OPRF"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1588-2612","authenticated-orcid":false,"given":"Fei","family":"Xiao","sequence":"first","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3573-056X","authenticated-orcid":false,"given":"Chunyang","family":"Lv","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5297-0293","authenticated-orcid":false,"given":"Jianfeng","family":"Wang","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}],"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.1145\/3488932.3523254"},{"key":"e_1_3_3_2_3_2","first-page":"301","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. USENIX Association, 301\u2013318."},{"key":"e_1_3_3_2_4_2","series-title":"LNCS","first-page":"108","volume-title":"Financial Cryptography","author":"Camenisch Jan","year":"2009","unstructured":"Jan Camenisch and Gregory\u00a0M. Zaverucha. 2009. Private Intersection of Certified Sets. In Financial Cryptography(LNCS, Vol.\u00a05628). 108\u2013127."},{"key":"e_1_3_3_2_5_2","first-page":"1182","volume-title":"CCS","author":"Chandran Nishanth","year":"2021","unstructured":"Nishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi\u00a0Bhavana Obbattu, Sruthi Sekar, and Akash Shah. 2021. Efficient Linear Multiparty PSI and Extensions to Circuit\/Quorum PSI. In CCS. ACM, 1182\u20131204."},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Peter Rindal Mike Rosulek and Ni Trieu. 2018. PIR-PSI: Scaling Private Contact Discovery. Proc. Priv. Enhancing Technol. 2018 4 (2018) 159\u2013178.","DOI":"10.1515\/popets-2018-0037"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39256-6_9"},{"key":"e_1_3_3_2_9_2","first-page":"789","volume-title":"CCS","author":"Dong Changyu","year":"2013","unstructured":"Changyu Dong, Liqun Chen, and Zikai Wen. 2013. When private set intersection meets big data: an efficient and scalable protocol. In CCS. ACM, 789\u2013800."},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_6"},{"key":"e_1_3_3_2_14_2","unstructured":"Oded Goldreich. 1998. Secure multi-party computation. Manuscript. Preliminary version 78 110 (1998) 1\u2013108."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"S.\u00a0Dov Gordon Carmit Hazay and Phi\u00a0Hung Le. 2022. Fully Secure PSI via MPC-in-the-Head. Proc. Priv. Enhancing Technol. 2022 3 (2022) 291\u2013313.","DOI":"10.56553\/popets-2022-0073"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.23159"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_13"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"e_1_3_3_2_19_2","series-title":"LNCS","first-page":"195","volume-title":"Financial Cryptography","author":"Kamara Seny","year":"2014","unstructured":"Seny Kamara, Payman Mohassel, Mariana Raykova, and Seyed\u00a0Saeed Sadeghian. 2014. Scaling Private Set Intersection to Billion-Element Sets. In Financial Cryptography(LNCS, Vol.\u00a08437). Springer, 195\u2013215."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414506"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"e_1_3_3_2_22_2","first-page":"1257","volume-title":"CCS","author":"Kolesnikov Vladimir","year":"2017","unstructured":"Vladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek, and Ni Trieu. 2017. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. In CCS. ACM, 1257\u20131272."},{"key":"e_1_3_3_2_23_2","first-page":"1151","volume-title":"CCS","author":"Nevo Ofri","year":"2021","unstructured":"Ofri Nevo, Ni Trieu, and Avishay Yanai. 2021. Simple, Fast Malicious Multiparty Private Set Intersection. In CCS. ACM, 1151\u20131165."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_3_2_25_2","first-page":"2505","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. ACM, 2505\u20132517."},{"key":"e_1_3_3_2_26_2","volume-title":"libOTe: an efficient, portable, and easy to use Oblivious Transfer Library","author":"Rindal Peter","unstructured":"Peter Rindal. [n. d.]. libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_3_2_29_2","volume-title":"Efficient Private Set Intersection base on VOLE","unstructured":"RindalVisa. [n. d.]. Efficient Private Set Intersection base on VOLE. https:\/\/github.com\/Visa-Research\/volepsi\/"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358927"}],"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.3736218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T07:31:02Z","timestamp":1755070262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3708821.3736218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,24]]},"references-count":29,"alternative-id":["10.1145\/3708821.3736218","10.1145\/3708821"],"URL":"https:\/\/doi.org\/10.1145\/3708821.3736218","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"}}]}}