Distributed Subgraph Matching Privacy Preserving Method for Dynamic Social Network

Abstract

The growing popularity of cloud platforms store and process large-scale social network data, if we do not pay attention to the method of using a cloud platform, privacy leakage will become a serious problem. In this paper, we propose a distributed k-automorphism algorithm and a distributed subgraph matching method, the distributed k-automorphism algorithm can efficiently protect the privacy of the social networks in the cloud platform by adding noise edges to ensure k-automorphism and the distributed subgraph matching method can quickly obtain temp subgraph matching results. After temp results are joined, we can obtain correct results by recovering and filtering temp results according to the symmetry of the k-automorphism graph and k-automorphism functions in the client. We also propose a modified method that utilizing incremental thought to solve the problem of dynamic subgraph matching. The experiments show that the above methods are effective in dealing with large scale social network graph problem and these methods can effectively solve the problem of privacy leakage of subgraph matching.