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

K-stars LDP:一种在局部差分隐私下进行 (p, q)-clique 枚举的新型框架

K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy

Henan Sun, Zhengyu Wu, Rong-Hua Li, Guoren Wang, Zening Li

AI总结:

针对边 LDP 在二部图 (p, q)-clique 计数中噪声大、误差高的问题,提出 k-stars LDP 框架,通过邻居列表、RR、校正与采样降低估计误差。

摘要:

二部图上的 (p, q)-clique 枚举对于计算聚类系数和检测最密子图至关重要。由于子图计数可能包含敏感信息,因此有必要在保护用户隐私、使其免受任何潜在攻击者侵害的同时执行子图枚举。最近的大多数研究都集中于基于边 LDP(局部差分隐私)的隐私保护算法。然而,由于需要添加大量噪声,这些算法会产生较大的估计误差。本文提出了一种 k-stars LDP 的新思想,以及一种用于 (p, q)-clique 枚举且估计误差较小的新型 k-stars LDP 算法,其中 k-stars 是由 k 个节点连接到一个节点所构成的星形图。边 LDP 的有效性依赖于其混淆用户与其一跳邻居之间边是否存在的能力。这建立在用户应当知道其一跳邻居是否存在这一前提之上。类似地,我们也可以将该前提应用于 k-stars,其中边是 1-stars 的一种特定类型。基于这一事实,我们首先提出 k-stars 邻居列表,使算法能够利用 Warner 的 RR 混淆 k-stars 的存在性。随后,我们提出绝对值校正技术和 k-stars 采样技术,以进一步降低估计误差。最后,借助两轮用户—收集者交互机制,我们提出了用于统计 (p, q)-clique 数量的 k-stars LDP 算法,同时成功保护用户隐私。理论分析和实验均表明,与基于边 LDP 的算法相比,我们的算法具有优越性。

英文摘要:

(p,q)-clique enumeration on a bipartite graph is critical for calculating clustering coefficient and detecting densest subgraph. It is necessary to carry out subgraph enumeration while protecting users' privacy from any potential attacker as the count of subgraph may contain sensitive information. Most recent studies focus on the privacy protection algorithms based on edge LDP (Local Differential Privacy). However, these algorithms suffer a large estimation error due to the great amount of required noise. In this paper, we propose a novel idea of k-stars LDP and a novel k-stars LDP algorithm for (p, q)-clique enumeration with a small estimation error, where a k-stars is a star-shaped graph with k nodes connecting to one node. The effectiveness of edge LDP relies on its capacity to obfuscate the existence of an edge between the user and his one-hop neighbors. This is based on the premise that a user should be aware of the existence of his one-hop neighbors. Similarly, we can apply this premise to k-stars as well, where an edge is a specific genre of 1-stars. Based on this fact, we first propose the k-stars neighboring list to enable our algorithm to obfuscate the existence of k-stars with Warner' s RR. Then, we propose the absolute value correction technique and the k-stars sampling technique to further reduce the estimation error. Finally, with the two-round user-collector interaction mechanism, we propose our k-stars LDP algorithm to count the number of (p, q)-clique while successfully protecting users' privacy. Both the theoretical analysis and experiments have showed the superiority of our algorithm over the algorithms based on edge LDP.

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

↑