PrivMin:用于Jaccard相似性计算的差分私有MinHash
PrivMin: Differentially Private MinHash for Jaccard Similarity Computation
摘要:
在大数据的许多工业应用中,Jaccard相似度计算已被广泛用于测量两个用户分别拥有的两个配置文件或集合之间的距离。然而,具有不可预测知识的一个半诚实用户也可以推断出私有或敏感信息(例如,原始集合中单个元素的存在)。在本文中,我们的目标是解决隐私问题的Jaccard相似性计算与严格的差分隐私保证。为了实现这一点,我们首先定义了条件$ε$ -DPSO,一个宽松的差分隐私定义关于集合操作,并证明了基于MinHash的Jaccard相似性计算(MH-JSC)满足此定义。为了在MH-JSC中实现严格的差分隐私,我们提出了PrivMin算法,该算法包括两个隐私操作:1)通过在MinHash签名生成过程中引入指数噪声,生成PrivMinHash值。2)随机MinHashing步骤选择通过采用随机响应技术来私下选择MinHashing阶段中使用指数机制部署的几个步骤。在真实数据集上的实验表明,该算法在保持隐私性的同时,能够有效地保留计算相似度的效用.
英文摘要:
In many industrial applications of big data, the Jaccard Similarity Computation has been widely used to measure the distance between two profiles or sets respectively owned by two users. Yet, one semi-honest user with unpredictable knowledge may also deduce the private or sensitive information (e.g., the existence of a single element in the original sets) of the other user via the shared similarity. In this paper, we aim at solving the privacy issues in Jaccard similarity computation with strict differential privacy guarantees. To achieve this, we first define the Conditional $ε$-DPSO, a relaxed differential privacy definition regarding set operations, and prove that the MinHash-based Jaccard Similarity Computation (MH-JSC) satisfies this definition. Then for achieving strict differential privacy in MH-JSC, we propose the PrivMin algorithm, which consists of two private operations: 1) the Private MinHash Value Generation that works by introducing the Exponential noise to the generation of MinHash signature. 2) the Randomized MinHashing Steps Selection that works by adopting Randomized Response technique to privately select several steps within the MinHashing phase that are deployed with the Exponential mechanism. Experiments on real datasets demonstrate that the proposed PrivMin algorithm can successfully retain the utility of the computed similarity while preserving privacy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。