Distributed privacy preserving technology in dynamic networks
by Zhuolin Li; Xiaolin Zhang; Haochen Yuan; Yongping Wang; Jian Li
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 15, No. 3/4, 2019

Abstract: With the development of information technology, large-scale social network graph data have been produced and released to provide data analysis for scientific research and business structures, while traditional network privacy protection technology does not meet the actual requirements. In this paper, we address the privacy risks of link disclosure in sequential release of a dynamic network. To prevent privacy breaches, we proposed the privacy model k^m - number of mutual friend, where k indicates the privacy level and m is a time period that an adversary can monitor a victim to collect the attack knowledge. We present a distributed algorithm to generate releases by adding nodes in parallel. Further, in order to improve availability of anonymous graphs, distributed greedy merge noise node algorithm (DGMNNA) is designed to reduce the number of nodes added under the premise of satisfying the anonymous model. The experimental results show that the proposed algorithm can efficiently handle large-scale social network data while ensuring the availability of anonymous data.

Online publication date: Mon, 30-Mar-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com