Distance-Aware OT with Application to Fuzzy PSI
Lucas Piske, Jaspal Singh, Ni Trieu, Vladimir Kolesnikov, Vassilis Zikas
Abstract
A two-party fuzzy private set intersection (PSI) protocol between Alice and Bob with input sets A and B allows Alice to learn nothing more than the points of Bob that are ''δ-close'' to its points in some metric space dist . More formally, Alice learns only the set b | dist (a,b) ≤ δ, a ∈ A, b ∈ B for a predefined threshold δ and distance metric dist, while Bob learns nothing about Alice's set. Fuzzy PSI is a valuable privacy tool in scenarios where private set intersection needs to be computed over imprecise or measurement-based data, such as GPS coordinates or healthcare data. Previous approaches to fuzzy PSI rely on asymmetric cryptographic primitives, generic two-party computation (2PC) techniques like garbled circuits, or function secret sharing methods, all of which are computationally intensive and lead to poor concrete efficiency. This work introduces a new modular framework for fuzzy PSI, primarily built on efficient symmetric key primitives. Our framework reduces the design of efficient fuzzy PSI to a novel variant of oblivious transfer (OT), which we term distance-aware random OT (da-ROT). This variant enables the sender to obtain two random strings (r0, r1), while the receiver obtains one of these values rb, depending on whether the receiver's input keyword a and the sender's input keyword b are close in some metric space i.e., dist (a,b) ≤ δ. The da-ROT can be viewed as a natural extension of traditional OT, where the condition (choice bit) is known to the receiver. We propose efficient constructions for da-ROT based on standard OT techniques tailored for small domains, supporting distance metrics such as the Chebyshev norm, the Euclidean norm, and the Manhattan norm. By integrating these da-ROT constructions, our fuzzy PSI framework achieves up to a 14× reduction in communication cost and up to a 54× reduction in computation cost compared to previous state-of-the-art protocols, across input set sizes ranging from 28 to 216. Additionally, we extend our framework to compute fuzzy PSI cardinality and fuzzy join from traditional PSI-related functionalities. All proposed protocols are secure in the semi-honest model.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers4
- Efficient Fuzzy Private Set Intersection from Secret-Shared OPRFXinpeng Yang, Meng Hao, Chenkai Weng, Robert H. Deng et al.S&P 2026 · 2 citations
- Towards Scalable Fuzzy PSI via Efficient Fuzzy MatchingMeng Hao, Xinpeng Yang, Hanxiao Chen, Tianwei Zhang et al.CCS 2026
- Efficient Fuzzy PSI under One-Sided AssumptionsXinpeng Yang, Meng Hao, Yanxue Jia, Chenkai Weng et al.CCS 2026
- Unbalanced Fuzzy Private Set Intersection for L_infinity Distance: Achieving Sublinear Communication with Large Set SizeShengzhe Meng, Xiaodong Wang, Xv Zhou, Bei LiangUSENIX Security 2026
Builds on14
- Efficient Batched Oblivious PRF with Applications to Private Set IntersectionVladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni TrieuCCS 2016 · 429 citations
- PSI from PaXoS: Fast, Malicious Private Set IntersectionBenny Pinkas, Mike Rosulek, Ni Trieu, Avishay YanaiEUROCRYPT 2020 · 198 citations
- Oblivious Key-Value Stores and Amplification for Private Set IntersectionGayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu et al.CRYPTO 2021 · 139 citations
- Fuzzy Labeled Private Set Intersection with Applications to Private Real-Time Biometric SearchErkam Uzun, Simon P. Chung, Vladimir Kolesnikov, Alexandra Boldyreva et al.USENIX Security 2021 · 49 citations
- DUPLO: Unifying Cut-and-Choose for Garbled CircuitsVladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu et al.CCS 2017 · 38 citations
Related papers
- Structure-Aware Private Set Intersection, with Applications to Fuzzy MatchingGayathri Garimella, Mike Rosulek, Jaspal SinghCRYPTO 2022 · 34 citations
- Fuzzy Private Set Intersection with Large HyperballsAron van Baarsen, Sihang PuEUROCRYPT 2024 · 18 citations
- Assumption-Free Fuzzy PSI via Predicate EncryptionErik-Oliver Blass, Guevara NoubirUSENIX Security 2026 · 6 citations
- Distance-Aware Private Set IntersectionAnrin Chakraborti, Giulia Fanti, Michael K. ReiterUSENIX Security 2023
- Efficient Private Filtering and Aggregation for Weighted Set Intersection via Oblivious Encrypted Weight TransferXiaodong Wang, Shengzhe Meng, Zijie Lu, Bei LiangCCS 2026
