CARGO:无需可信服务器的加密辅助差分隐私三角计数
CARGO: Crypto-Assisted Differentially Private Triangle Counting without Trusted Servers
AI总结:
提出加密辅助的差分隐私三角计数系统CARGO,结合相似性投影、秘密共享和分布式扰动,在无需可信服务器下达到中心模型效用,显著优于本地模型。
摘要:
图上的差分隐私三角计数对于分析连接模式和计算聚类系数至关重要,同时能保护敏感的个人信息。以往的工作要么依赖中心模型,要么依赖本地模型来实施差分隐私。然而,在差分隐私三角计数中,中心模型和本地模型之间存在着显著的效用差距,这取决于是否需要可信服务器。特别是,中心模型提供了高精度,但需要一个可信服务器。本地模型不需要可信服务器,但精度有限。我们的论文介绍了一个名为CARGO的加密辅助差分隐私三角计数系统,利用密码学构件来提高差分隐私三角计数的有效性,而无需假设可信服务器。它实现了类似于中心模型的高效用,但又像本地模型一样无需可信服务器。CARGO由三个主要部分组成。首先,我们提出了一种基于相似性的投影方法,通过三角同质性减少全局灵敏度,同时保留更多三角形。其次,我们提出了一种基于加法秘密共享的三角计数方案,该方案在保护敏感信息的同时安全且准确地计算三角形。第三,我们设计了一种分布式扰动算法,用最小但足够的噪声扰动三角计数。我们还对我们提出的方法进行了全面的理论和实证分析。大量实验表明,我们的CARGO在效用方面显著优于本地模型,并实现了与中心模型相当的高效用三角计数。
英文摘要:
Differentially private triangle counting in graphs is essential for analyzing connection patterns and calculating clustering coefficients while protecting sensitive individual information. Previous works have relied on either central or local models to enforce differential privacy. However, a significant utility gap exists between the central and local models of differentially private triangle counting, depending on whether or not a trusted server is needed. In particular, the central model provides a high accuracy but necessitates a trusted server. The local model does not require a trusted server but suffers from limited accuracy. Our paper introduces a crypto-assisted differentially private triangle counting system, named CARGO, leveraging cryptographic building blocks to improve the effectiveness of differentially private triangle counting without assumption of trusted servers. It achieves high utility similar to the central model but without the need for a trusted server like the local model. CARGO consists of three main components. First, we introduce a similarity-based projection method that reduces the global sensitivity while preserving more triangles via triangle homogeneity. Second, we present a triangle counting scheme based on the additive secret sharing that securely and accurately computes the triangles while protecting sensitive information. Third, we design a distributed perturbation algorithm that perturbs the triangle count with minimal but sufficient noise. We also provide a comprehensive theoretical and empirical analysis of our proposed methods. Extensive experiments demonstrate that our CARGO significantly outperforms the local model in terms of utility and achieves high-utility triangle counting comparable to the central model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。