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

arXiv:2403.01788v1 Announce Type: new
Abstract: (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 …

arxiv attacker clustering critical cs.cr cs.cy cs.ds differential privacy enumeration framework graph information local may novel privacy protecting sensitive sensitive information stars under