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

模糊私有匹配(扩展摘要)

Fuzzy Private Matching (Extended Abstract)

Łukasz Chmielewski, Jaap-Henk Hoepman

摘要:

在私有匹配问题中,客户端和服务器各自持有一组$n$输入元素。客户端想私下计算这两个集合的交集:他知道他与服务器有哪些共同点(仅此而已),而服务器根本没有获得任何信息。在某些应用中,具有私有匹配协议将是有用的,该协议即使两个元素仅相似而不是相等也报告匹配。这样的私有匹配协议被称为\emph{fuzzy},并且例如在元素可能不准确或被错误破坏时是有用的。我们考虑模糊私人匹配问题,在一个半诚实的环境。如果元素在$T$属性中的$t$上匹配,则它们是相似的。首先,我们表明,弗里德曼等人提出的原始解决方案是不正确的。随后,我们提出了两个模糊私有匹配协议。第一个简单的协议具有位消息复杂性$O(n \binom{T}{t} (T \log{|D|}+k))$。第二种改进的协议具有更好的位消息复杂度$O(n T (\log{|D|}+k))$,但是这里客户端导致O(n)因子时间复杂度。此外,我们提出的协议的基础上计算的汉明距离和不经意的传输,有不同的,有时更有效的,性能特点。

英文摘要:

In the private matching problem, a client and a server each hold a set of $n$ input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain applications it would be useful to have a private matching protocol that reports a match even if two elements are only similar instead of equal. Such a private matching protocol is called \emph{fuzzy}, and is useful, for instance, when elements may be inaccurate or corrupted by errors. We consider the fuzzy private matching problem, in a semi-honest environment. Elements are similar if they match on $t$ out of $T$ attributes. First we show that the original solution proposed by Freedman et al. is incorrect. Subsequently we present two fuzzy private matching protocols. The first, simple, protocol has bit message complexity $O(n \binom{T}{t} (T \log{|D|}+k))$. The second, improved, protocol has a much better bit message complexity of $O(n T (\log{|D|}+k))$, but here the client incurs a O(n) factor time complexity. Additionally, we present protocols based on the computation of the Hamming distance and on oblivious transfer, that have different, sometimes more efficient, performance characteristics.

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

↑