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

快速模糊私有集求交

Fast and Fuzzy Private Set Intersection

Nicholas Kersting

摘要:

私有集合交集(PSI)通常被实现为成对用户之间的加密轮序列,而本工作以更简单的方式实现PSI:每个集合只需要加密一次,之后每对用户只需要一个普通的集合比较。这通常比普通PSI快几个数量级,代价是匹配中的一些“延迟”,尽管如此,这可能是可容忍的,甚至是期望的。这在集合由用WordNet处理的英语单词组成的情况下得到了证明。

英文摘要:

Private Set Intersection (PSI) is usually implemented as a sequence of encryption rounds between pairs of users, whereas the present work implements PSI in a simpler fashion: each set only needs to be encrypted once, after which each pair of users need only one ordinary set comparison. This is typically orders of magnitude faster than ordinary PSI at the cost of some ``fuzziness" in the matching, which may nonetheless be tolerable or even desirable. This is demonstrated in the case where the sets consist of English words processed with WordNet.

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

↑