Deakin University
Browse

An iteration-based differentially private social network data release

Version 2 2024-06-03, 11:49
Version 1 2018-09-10, 14:25
journal contribution
posted on 2024-06-03, 11:49 authored by T Zhu, M Yang, P Xiong, Y Xiang, W Zhou
Online social networks provide an unprecedented opportunity for researchers to analysis various social phenomena. These network data is normally represented as graphs, which contain many sensitive individual information. Publish these graph data will violate users' privacy. Differential privacy is one of the most influential privacy models that provides a rigorous privacy guarantee for data release. However, existing works on graph data publishing cannot provide accurate results when releasing a large number of queries. In this paper, we propose a graph update method transferring the query release problem to an iteration process, in which a large set of queries are used as update criteria. Compared with existing works, the proposed method enhances the accuracy of query results. The extensive experiment proves that the proposed solution outperforms two state-of-the-art methods, the Laplace method and the correlated method, in terms of Mean Absolute Value. It means our methods can retain more utility of the queries while preserving the privacy.

History

Journal

Computer systems science and engineering

Volume

33

Pagination

61-69

Location

Leicester, Eng.

ISSN

0267-6192

Language

eng

Publication classification

CN Other journal article

Copyright notice

2018, CRL Publishing Ltd.

Issue

2

Publisher

CRL Publishing

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC