{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:11:49Z","timestamp":1767183109283,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":34,"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":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2115075, CNS-2246354,CCF-2217070,2020277"],"award-info":[{"award-number":["2115075, CNS-2246354,CCF-2217070,2020277"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARPA-H","award":["SP4701-23-C-0074"],"award-info":[{"award-number":["SP4701-23-C-0074"]}]},{"name":"Visa research"},{"name":"Sunday Group"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3744857","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:32:38Z","timestamp":1763854358000},"page":"4679-4691","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Distance-Aware OT with Application to Fuzzy PSI"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1698-2176","authenticated-orcid":false,"given":"Lucas","family":"Piske","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7984-4609","authenticated-orcid":false,"given":"Jaspal","family":"Singh","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, Indiana, USA and Georgia Institute of Technology, Atlanta, Georgia, 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, Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0211-1244","authenticated-orcid":false,"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, Georgia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5422-7572","authenticated-orcid":false,"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, Georgia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"04","volume":"1","author":"Two Party Computation GitHub","unstructured":"GitHub - emp-toolkit\/emp-sh2pc: Semi-honest Two Party Computation Based on Garbled Circuits. -- github.com. https:\/\/github.com\/emp-toolkit\/emp-sh2pc.git. [Accessed 16-04-2025].","journal-title":"Accessed"},{"key":"e_1_3_2_1_2_1","first-page":"234","volume-title":"Conference on the Theory and Application of Cryptographic Techniques","author":"Brassard Gilles","year":"1986","unstructured":"Gilles Brassard, Claude Cr\u00e9peau, and Jean-Marc Robert. All-or-nothing disclosure of secrets. In Conference on the Theory and Application of Cryptographic Techniques, pages 234-238. Springer, 1986."},{"key":"e_1_3_2_1_3_1","volume-title":"Paper 2021\/034","author":"Chandran Nishanth","year":"2021","unstructured":"Nishanth Chandran, Divya Gupta, and Akash Shah. Circuit-PSI with linear complexity via relaxed batch OPPRF. Cryptology ePrint Archive, Paper 2021\/034, 2021."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Chongwon Cho Dana Dachman-Soled and Stanislaw Jarecki. Efficient concurrent covert computation of string equality and set intersection. In Kazue Sako editor CT-RSA 2016 volume 9610 of LNCS pages 164-179. Springer Cham February \/ March 2016.","DOI":"10.1007\/978-3-319-29485-8_10"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0041"},{"key":"e_1_3_2_1_6_1","volume-title":"Paper 2024\/1462","author":"Gao Ying","year":"2024","unstructured":"Ying Gao, Lin Qi, Xiang Liu, Yuanchao Luo, and Longxin Wang. Efficient fuzzy private set intersection from fuzzy mapping. Cryptology ePrint Archive, Paper 2024\/1462, 2024."},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient fuzzy private set intersection from fuzzy mapping. Cryptology ePrint Archive","author":"Gao Ying","year":"2024","unstructured":"Ying Gao, Lin Qi, Xiang Liu, Yuanchao Luo, and Longxin Wang. Efficient fuzzy private set intersection from fuzzy mapping. Cryptology ePrint Archive, 2024."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella Benjamin Goff and Peihan Miao. Computation efficient structure-aware PSI from incremental function secret sharing. In Leonid Reyzin and Douglas Stebila editors CRYPTO 2024 Part VIII volume 14927 of LNCS pages 309-345. Springer Cham August 2024.","DOI":"10.1007\/978-3-031-68397-8_10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella Payman Mohassel Mike Rosulek Saeed Sadeghian and Jaspal Singh. Private set operations from oblivious switching. In Juan Garay editor PKC 2021 Part II volume 12711 of LNCS pages 591-617. Springer Cham May 2021.","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. Oblivious key-value stores and amplification for private set intersection. In Tal Malkin and Chris Peikert editors CRYPTO 2021 Part II volume 12826 of LNCS pages 395-425 Virtual Event August 2021. Springer Cham.","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella Mike Rosulek and Jaspal Singh. Structure-aware private set intersection with applications to fuzzy matching. In Yevgeniy Dodis and Thomas Shrimpton editors CRYPTO 2022 Part I volume 13507 of LNCS pages 323-352. Springer Cham August 2022.","DOI":"10.1007\/978-3-031-15802-5_12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella Mike Rosulek and Jaspal Singh. Malicious secure structure-aware private set intersection. In Helena Handschuh and Anna Lysyanskaya editors CRYPTO 2023 Part I volume 14081 of LNCS pages 577-610. Springer Cham August 2023.","DOI":"10.1007\/978-3-031-38557-5_19"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov and Ranjit Kumaresan. Improved OT extension for transferring short secrets. In Ran Canetti and Juan A. Garay editors CRYPTO 2013 Part II volume 8043 of LNCS pages 54-70. Springer Berlin Heidelberg August 2013.","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"e_1_3_2_1_15_1","first-page":"818","volume-title":"ACM CCS 2016","author":"Kolesnikov Vladimir","year":"2016","unstructured":"Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu. Efficient batched oblivious PRF with applications to private set intersection. In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, ACM CCS 2016, pages 818-829. ACM Press, October 2016."},{"key":"e_1_3_2_1_16_1","first-page":"3","volume-title":"Mike Rosulek, Ni Trieu, and Roberto Trifiletti. DUPLO: Unifying cut-and-choose for garbled circuits. In Bhavani M. Thuraisingham","author":"Kolesnikov Vladimir","year":"2017","unstructured":"Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, and Roberto Trifiletti. DUPLO: Unifying cut-and-choose for garbled circuits. In Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, editors, ACM CCS 2017, pages 3-20. ACM Press, October \/ November 2017."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92075-3_21"},{"key":"e_1_3_2_1_18_1","first-page":"6453","volume-title":"33rd USENIX Security Symposium (USENIX Security 24)","author":"Mahdavi Rasoul Akhavan","year":"2024","unstructured":"Rasoul Akhavan Mahdavi, Nils Lukas, Faezeh Ebrahimianghazani, Thomas Humphries, Bailey Kacsmar, John Premkumar, Xinda Li, Simon Oya, Ehsan Amjadian, and Florian Kerschbaum. PEPSI: Practically efficient private set intersection in the unbalanced setting. In 33rd USENIX Security Symposium (USENIX Security 24), pages 6453-6470, Philadelphia, PA, August 2024. USENIX Association."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Ian McQuoid Mike Rosulek and Lawrence Roy. Batching base oblivious transfers. In Mehdi Tibouchi and Huaxiong Wang editors ASIACRYPT 2021 Part III volume 13092 of LNCS pages 281-310. Springer Cham December 2021.","DOI":"10.1007\/978-3-030-92078-4_10"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0040"},{"key":"e_1_3_2_1_21_1","first-page":"1151","volume-title":"ACM CCS 2021","author":"Nevo Ofri","year":"2021","unstructured":"Ofri Nevo, Ni Trieu, and Avishay Yanai. Simple, fast malicious multiparty private set intersection. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 1151-1165. ACM Press, November 2021."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. SpOT-light: Lightweight private set intersection from sparse OT extension. In Alexandra Boldyreva and Daniele Micciancio editors CRYPTO 2019 Part III volume 11694 of LNCS pages 401-431. Springer Cham August 2019.","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. PSI from PaXoS: Fast malicious private set intersection. In Anne Canteaut and Yuval Ishai editors EUROCRYPT 2020 Part II volume 12106 of LNCS pages 739-767. Springer Cham May 2020.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_2_1_24_1","volume-title":"Anderson CA Nascimento, and Ni Trieu. Shared ot and its applications to unconditional secure integer equality, comparison and bit-decomposition. Cryptology ePrint Archive","author":"Piske Lucas","year":"2024","unstructured":"Lucas Piske, Jeroen Graaf, Anderson CA Nascimento, and Ni Trieu. Shared ot and its applications to unconditional secure integer equality, comparison and bit-decomposition. Cryptology ePrint Archive, 2024."},{"key":"e_1_3_2_1_25_1","volume-title":"Paper 2025\/996","author":"Piske Lucas","year":"2025","unstructured":"Lucas Piske, Jaspal Singh, Ni Trieu, Vladimir Kolesnikov, and Vassilis Zikas. Distance-aware OT with application to fuzzy PSI. Cryptology ePrint Archive, Paper 2025\/996, 2025."},{"key":"e_1_3_2_1_26_1","volume-title":"Paper 2025\/996","author":"Piske Lucas","year":"2025","unstructured":"Lucas Piske, Jaspal Singh, Ni Trieu, Vladimir Kolesnikov, and Vassilis Zikas. Distance-aware OT with application to fuzzy PSI. Cryptology ePrint Archive, Paper 2025\/996, 2025."},{"key":"e_1_3_2_1_27_1","volume-title":"How to exchange secrets by oblivious transfer","author":"Rabin Michael","year":"1981","unstructured":"Michael Rabin. How to exchange secrets by oblivious transfer, 1981."},{"key":"e_1_3_2_1_28_1","volume-title":"volepsi: A protocol for private set intersection. https:\/\/github.com\/Visa-Research\/volepsi\/blob\/main\/volePSI\/","author":"Research Visa","year":"2023","unstructured":"Visa Research. volepsi: A protocol for private set intersection. https:\/\/github.com\/Visa-Research\/volepsi\/blob\/main\/volePSI\/, 2023. Accessed: 2025-01-07."},{"key":"e_1_3_2_1_29_1","volume-title":"Fuzzy psi via oblivious protocol routing. Cryptology ePrint Archive","author":"Richardson David","year":"2024","unstructured":"David Richardson, Mike Rosulek, and Jiayu Xu. Fuzzy psi via oblivious protocol routing. Cryptology ePrint Archive, 2024."},{"key":"e_1_3_2_1_30_1","volume-title":"cryptotools: A cryptographic library for secure computation. https:\/\/github.com\/ladnir\/cryptoTools","author":"Peter Rindal","year":"2023","unstructured":"Peter Rindal et al. cryptotools: A cryptographic library for secure computation. https:\/\/github.com\/ladnir\/cryptoTools, 2023. Accessed: 2025-01-07."},{"key":"e_1_3_2_1_31_1","volume-title":"libote: A fast and portable oblivious transfer library. https:\/\/github.com\/osu-crypto\/libOTe","author":"Peter Rindal","year":"2023","unstructured":"Peter Rindal et al. libote: A fast and portable oblivious transfer library. https:\/\/github.com\/osu-crypto\/libOTe, 2023. Accessed: 2025-01-07."},{"key":"e_1_3_2_1_32_1","first-page":"1166","volume-title":"ACM CCS 2021","author":"Rosulek Mike","year":"2021","unstructured":"Mike Rosulek and Ni Trieu. Compact and malicious private set intersection for small sets. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 1166-1181. ACM Press, November 2021."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58740-5_12"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58740-5_12"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"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.3744857","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3744857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:10:25Z","timestamp":1766441425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3744857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":34,"alternative-id":["10.1145\/3719027.3744857","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3744857","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"}}]}}