An Anonymization Algorithm for (α, β, γ, δ)-Social Network Privacy Considering Data Utility

Mehri Rajaei (Iran University of Science and Technology, Iran)

Mostafa S. Haghjoo (PayameNoor University, Iran)

Eynollah Khanjari Miyaneh (Iran University of Science and Technology, Iran)

Abstract: A well-known privacy-preserving network data publication problem focuses on how to publish social network data while protecting privacy and permitting useful analysis. Designing algorithms that safely transform network data is an active area of research. The process of applying these transformations is called anonymization operation. The authors recently proposed the (?,?,?,?)-SNP (Social Network Privacy) model and its an anonymization technique. The present paper introduces a novel anonymization algorithm for the (?,?,?,?)-SNP model. The desirability metric between two individuals of social network is defined to show the desirability of locating them in one group keeping in mind privacy and data utility considerations. Next, individuals are grouped using a greedy algorithm based on the values of this metric. This algorithm tries to generate small-sized groups by maximizing the sum of desirability values between members of each group. The proposed algorithm was tested using two real datasets and one synthetic dataset. Experimental results show satisfactory data utility for topological, spectrum and aggregate queries on anonymized data. The results of the proposed algorithm were compared in the topological properties with results of two recently proposed anonymization schemes: Subgraph-wise Perturbation (SP) and Neighborhood Randomization (NR). The results show that the proposed method is better than or similar to SP and NR for preservation of all structural and spectrum properties, except for the clustering coefficient.

Keywords: anonymization, background knowledge, data utility, information loss, network data sharing, privacy

Categories: H.0,, H.2, K.6.5, L.4