SNGPLDP: Social network graph generation based on personalised local differential privacy
by Zixuan Shen; Jianwei Fei; Zhihua Xia
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 17, No. 2, 2024

Abstract: The social network graph (SNG) can display valuable information. Its generation needs vast amounts of users' data. However, conflicts arise between generating the SNG and protecting the sensitive data therein. To balance it, some SNG generation schemes are proposed by using local differential privacy (LDP) techniques while they do not consider the personalised privacy requirements of users. This paper proposes an SNG generation scheme by designing a personalised LDP method, named SNGPLDP. Specifically, we develop a personalised randomised perturbation mechanism that satisfies ∈_total- PLDP to perturb users' private data. A seed graph creation mechanism and an optimised graph generation mechanism (OGGM) are then designed to generate and optimise the SNG with the perturbed data. Experiments performed on four real datasets show the effectiveness of SNGPLDP in providing PLDP protection with general graph properties. Moreover, the proposed scheme achieves higher network structure cohesion and supports stronger privacy protection than the advanced methods.

Online publication date: Fri, 01-Mar-2024

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 Autonomous and Adaptive Communications Systems (IJAACS):
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