arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.08534cs.CR
收藏

具有差分隐私的联合重量级发现

Federated Heavy Hitters Discovery with Differential Privacy

Wennan Zhu, Peter Kairouz, Brendan McMahan, Haicheng Sun, Wei Li

摘要:

在用户生成的数据流中发现重量级人物(最常见的项目)推动了应用程序和Web生态系统的改进,但如果不小心,可能会引发重大的隐私风险。为了解决这些风险,我们提出了一个分布式和隐私保护的算法,发现在人口的用户生成的数据流中的重量级人物。我们利用我们的分布式算法的采样和阈值属性来证明它本质上是差分私有的,而不需要额外的噪声。我们还检查了隐私和实用性之间的权衡,并表明我们的算法提供了出色的实用性,同时还实现了强有力的隐私保证。这种方法的一个显著优点是,它消除了对集中原始数据的需要,同时还避免了由本地差分隐私引起的效用的显著损失。我们在理论上验证了我们的研究结果,使用最坏情况分析,实际上,使用Twitter数据集,有160万条推文和超过65万用户。最后,我们仔细比较了我们的方法与苹果的本地差分隐私方法,以发现重量级人物。

英文摘要:

The discovery of heavy hitters (most frequent items) in user-generated data streams drives improvements in the app and web ecosystems, but can incur substantial privacy risks if not done with care. To address these risks, we propose a distributed and privacy-preserving algorithm for discovering the heavy hitters in a population of user-generated data streams. We leverage the sampling and thresholding properties of our distributed algorithm to prove that it is inherently differentially private, without requiring additional noise. We also examine the trade-off between privacy and utility, and show that our algorithm provides excellent utility while also achieving strong privacy guarantees. A significant advantage of this approach is that it eliminates the need to centralize raw data while also avoiding the significant loss in utility incurred by local differential privacy. We validate our findings both theoretically, using worst-case analyses, and practically, using a Twitter dataset with 1.6M tweets and over 650k users. Finally, we carefully compare our approach to Apple's local differential privacy method for discovering heavy hitters.

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

↑