Resumen:
Online social network datasets contain a large amount of various information about their users. Preserving users' privacy while publishing or sharing datasets with third parties has become a challenging problem. The k-automorphism is the anonymization method that protects the social network dataset against any passive structural attack. It provides a higher level of protection than other k-anonymity methods, including k-degree or k-neighborhood techniques. In this paper, we propose a hybrid algorithm that effectively modifies the social network to the k-automorphism one. The proposed algorithm is based on the structure of the previously published k-automorphism KM algorithm. However, it solves the NP-hard subtask of finding isomorphic graph extensions with a genetic algorithm and employs the GraMi algorithm for finding frequent subgraphs. In the design of the genetic algorithm, we introduce the novel chromosome representation in which the length of the chromosome is independent of the size of the input network, and each individual in each generation leads to the k-automorphism solution. Moreover, we present a heuristic method for selecting the set of vertex disjoint subgraphs. To test the algorithm, we run experiments on a set of real social networks and use the SecGraph tool to evaluate our results in terms of protection against deanonymization attacks and preserving data utility. It makes our experimental results comparable with any future research.
