Collecting Clustering Coefficient of Distributed Graph Data with Shuffled Differential Privacy

Le résumé fourni par la source

The intricate properties and relevance of graph data make it difficult to collect graph statistics privately via differential privacy (DP). Traditional centralized or local DP on graph data, face challenges like third-party threats and low data utility when collecting the clustering coefficient. In this regard, we introduce GCC-SDP, a scheme for collecting distributed Graph Clustering Coefficient with Shuffled DP (SDP). GCC-SDP gathers the local wedge lists of all edges and adjacency bit vectors through SDP and random response for calculating the noisy local triangle counts. It then collects the local degree values of all users by using Laplace mechanism, followed by estimating the global clustering coefficient of the global graph data by data collector. We provide specific steps of GCC-SDP and demonstrate through theoretical analysis that GCC-SDP conforms to various DPs, with unbiased results. Empirical experiments show that GCC-SDP performs better than existing local DP-based techniques across most accuracy metrics.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.