Abstract
Recent trends show that the popularity of online social networks (OSNs) has been increasing rapidly. From daily communication sites to online communities, an average person’s daily life has become dependent on these online networks. Hence, it has become evident that protection should be provided to these networks from unwanted intruders. In this paper, we consider the data privacy on OSNs at the network level rather than the user level. This network-level privacy helps us to prevent information leakage to third-party users, such as advertisers. We propose a novel scheme that combines the privacy of all the elements of a social network: node, edge, and attribute privacy by clustering the users based on their attribute similarity. We use an enhanced equi-cardinal clustering (ECC) as a way to achieve $k$ -anonymity. We further improve $k$ -anonymity with $l$ -diversity. Our proposed enhanced ECC ensures that there are at least “ $k$ ” users in any given network as well as the attributes in each cluster has at least $l$ -distinct values. We further provide proofs on how the proposed ECC ensures $k$ -anonymity and the maximum information loss. We consider a weighted directed social network graph as an input to our method to consider the existing complexities in a social network. With the help of two real-world data sets, we evaluate this method in terms of privacy and efficiency.
Accepted Version
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call