Main Article Content
Abstract
—Theprotection of vertex and community identities of individuals in a dynamic network. A simple approach for this problem is to anonymize each release to satisfy some privacy model before a network is published. Due to the lack of consideration in sequential releases, adversaries can have chances to launch attacks and get advantages by gathering victim’s information continuously and comparing the multiple releases.The privacy risks of identity disclosures in sequential releases of a dynamic network.It also presents a heuristic algorithm for generating releases satisfying S- Kw -structural diversity anonymity so that the adversary cannot utilize his knowledge to re-identify the victim and take advantages. The evaluations on both real and synthetic data sets show that the proposed algorithm can retain much of the characteristics of the networks while confirming the privacy protection.