Fuzzy Private Set Intersection with Large Hyperballs

Traditional private set intersection (PSI) involves a receiver and a sender holding sets X and Y , respectively, with the receiver learning only the intersection X ∩Y . We turn ourattention to its fuzzy variant, where the receiver holds |X| hyperballs of radius δ in a metric space and the sender has |Y | points. Representing the hyperballs by their center, the receiver learns the points x ∈ X for which there exists y ∈ Y such that dist(x, y) ≤ δ with respect to some distance metric. Previous approaches either require general-purpose multi-party computation (MPC) techniques like garbled circuits or fully homomorphic encryption (FHE), leak details about the sender’s precise inputs, support limited distance metrics, or scale poorly with the hyperballs’ volume. This work presents the first black-box construction for fuzzy PSI (including other variants such as PSI cardinality, labeled PSI, and circuit PSI), which can handle polynomially large radius and dimension (i.e., a potentially exponentially large volume) in two interaction messages, supporting general Lp∈[1,∞] distance, without relying on garbled circuits or FHE. The protocol excels in both asymptotic and concrete efficiency compared to existing works. For security, we solely rely on the assumption that the Decisional Diffie-Hellman (DDH) holds in the random oracle model.