arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2112.14737cs.CR
收藏

距离感知的私有集交集

Distance-Aware Private Set Intersection

Anrin Chakraborti, Giulia Fanti, Michael K. Reiter

摘要:

私有集合交集(PSI)允许两个互不信任的方计算他们集合的交集,而不会泄露关于不在交集中的项目的信息。这项工作介绍了一个PSI的变种,称为距离感知PSI(DA-PSI)的集合,其元素位于度量空间。DA-PSI返回彼此在指定距离阈值内的项目对。本文给出了两个度量空间的DA-PSI构造:(i)整数集上的1阶Minkowski距离(即,对于整数$a$和$b$,它们的距离是$|a-b|$);以及(ii)长度为$\ell$的二进制串的集合上的汉明距离。在Minkowski DA-PSI协议中,通信复杂性与距离阈值成几何关系,与集合大小成线性关系。在Hamming DA-PSI协议中,通信量与距离阈值成二次关系,并且与字符串长度的维数$\ell$无关。与实际应用的实验结果证实,DA-PSI提供了更有效的匹配,在更低的成本比天真的解决方案。

英文摘要:

Private set intersection (PSI) allows two mutually untrusting parties to compute an intersection of their sets, without revealing information about items that are not in the intersection. This work introduces a PSI variant called distance-aware PSI (DA-PSI) for sets whose elements lie in a metric space. DA-PSI returns pairs of items that are within a specified distance threshold of each other. This paper puts forward DA-PSI constructions for two metric spaces: (i) Minkowski distance of order 1 over the set of integers (i.e., for integers $a$ and $b$, their distance is $|a-b|$); and (ii) Hamming distance over the set of binary strings of length $\ell$. In the Minkowski DA-PSI protocol, the communication complexity scales logarithmically in the distance threshold and linearly in the set size. In the Hamming DA-PSI protocol, the communication volume scales quadratically in the distance threshold and is independent of the dimensionality of string length $\ell$. Experimental results with real applications confirm that DA-PSI provides more effective matching at lower cost than naive solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑