arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.02437cs.CRcs.LG
收藏

FastLloyd:基于差分隐私的联邦、准确、安全且可调的 $k$-Means 聚类

FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy

University of Waterloo(滑铁卢大学)

Abdulrahman Diaa, Thomas Humphries, Florian Kerschbaum

AI总结:

针对横向联邦 $k$-means 中安全计算开销高与差分隐私效用差的问题,FastLloyd 结合计算型 DP 和安全聚合,并提出新的 DP 聚类机制,实现五个数量级加速且提升聚类效用。

摘要:

我们研究横向联邦环境中的隐私保护 $k$-means 聚类问题。现有采用安全计算的联邦方法存在显著开销,且无法提供输出隐私。同时,差分隐私(DP)$k$-means 算法要么假设存在可信的中央管理者,要么在本地 DP 模型中通过添加噪声而显著降低效用。简单地组合安全计算与中央 DP 解决方案会产生开销不切实际的协议。相反,我们的工作对 DP 和安全计算两部分都进行了增强,所得设计比以往工作更快、更私密且更准确。通过利用计算型 DP 模型,我们设计了一种轻量级、基于安全聚合的方法,相比最先进的相关工作实现了五个数量级的加速。此外,我们不仅保持了中央 DP 模型中最先进方法的效用,还通过设计一种新的 DP 聚类机制进一步提升了效用。

英文摘要:

We study the problem of privacy-preserving $k$-means clustering in the horizontally federated setting. Existing federated approaches using secure computation suffer from substantial overheads and do not offer output privacy. At the same time, differentially private (DP) $k$-means algorithms either assume a trusted central curator or significantly degrade utility by adding noise in the local DP model. Naively combining the secure and central DP solutions results in a protocol with impractical overhead. Instead, our work provides enhancements to both the DP and secure computation components, resulting in a design that is faster, more private, and more accurate than previous work. By utilizing the computational DP model, we design a lightweight, secure aggregation-based approach that achieves five orders of magnitude speed-up over state-of-the-art related work. Furthermore, we not only maintain the utility of the state-of-the-art in the central model of DP, but we improve the utility further by designing a new DP clustering mechanism.

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

↑