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

EsPRESSo:一种有效的隐私保护样本集相似性评价方法

EsPRESSo: Efficient Privacy-Preserving Evaluation of Sample Set Similarity

Carlo Blundo, Emiliano De Cristofaro, Paolo Gasti

摘要:

电子信息越来越多地在没有完全相互信任的实体之间共享。为了解决相关的安全和隐私问题,出现了一些支持隐私保护信息共享和检索的加密技术。在这种情况下,一个有趣的开放问题涉及需要评估其数据集相似性的两方,但不愿意透露其实际内容。本文提出了一种有效的和可证明安全的构造支持隐私保护的样本集相似性评估,其中相似性的Jaccard指数进行测量。我们提出了两个协议:第一个安全地计算两个集合的(Jaccard)相似性,第二个使用MinHash技术以较低的复杂度近似它。我们表明,我们的新协议是有吸引力的,在许多引人注目的应用程序,包括文档/多媒体相似性,生物特征认证和基因测试。在这个过程中,我们证明,我们的建设是明显更有效的比以前的工作。

英文摘要:

Electronic information is increasingly often shared among entities without complete mutual trust. To address related security and privacy issues, a few cryptographic techniques have emerged that support privacy-preserving information sharing and retrieval. One interesting open problem in this context involves two parties that need to assess the similarity of their datasets, but are reluctant to disclose their actual content. This paper presents an efficient and provably-secure construction supporting the privacy-preserving evaluation of sample set similarity, where similarity is measured as the Jaccard index. We present two protocols: the first securely computes the (Jaccard) similarity of two sets, and the second approximates it, using MinHash techniques, with lower complexities. We show that our novel protocols are attractive in many compelling applications, including document/multimedia similarity, biometric authentication, and genetic tests. In the process, we demonstrate that our constructions are appreciably more efficient than prior work.

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

↑