Distributed and personalised social network privacy protection

摘要

Considering the privacy issues on social network, a variety of anonymous techniques have been proposed, but these techniques neglect some differences among individuals in their demand for privacy protection. With the development of internet technology, the number of social network individuals increases yearly, and network data are poised for a massive change in trends. Motivated by this, we specify three levels of privacy information for victim individuals and propose a personalised k-degree-m-label (PKDML) anonymity model. Furthermore, we design and implement a distributed and personalised k-degree-m-lable (DPKDML) anonymisation algorithm, which takes advantage of the 'vertex-centric' GraphX programming model to complete the entire anonymous process by multiple message passing and node value updating. Finally, we conduct experiments on real social network datasets to evaluate the DPKDML, The experimental results show that our methods may overcome the shortcomings of traditional methods in processing massive data, and reduce anonymous costs and increase data utility.