Visible to the public A Topology Based Differential Privacy Scheme for Average Path Length Query

TitleA Topology Based Differential Privacy Scheme for Average Path Length Query
Publication TypeConference Paper
Year of Publication2019
AuthorsTong, Dong, Yong, Zeng, Mengli, Liu, Zhihong, Liu, Jianfeng, Ma, Xiaoyan, Zhu
Conference Name2019 International Conference on Networking and Network Applications (NaNA)
KeywordsAPL query, average path length query, composability, data availability, data privacy, data query, Differential privacy, differential privacy security mechanism, edge-weighted privacy protection, Erbium, Euclidean distance, Human Behavior, Network topology, network vertices, node privacy protection, Perturbation methods, privacy, privacy control parameters, privacy protection, pubcrawl, query function, query processing, Resiliency, Scalability, Sensitivity, topology based differential privacy scheme
AbstractDifferential privacy is heavily used in privacy protection due to it provides strong protection against private data. The existing differential privacy scheme mainly implements the privacy protection of nodes or edges in the network by perturbing the data query results. Most of them cannot meet the privacy protection requirements of multiple types of information. In order to overcome these issues, a differential privacy security mechanism with average path length (APL) query is proposed in this paper, which realize the privacy protection of both network vertices and edge weights. Firstly, by describing APL, the reasons for choosing this attribute as the query function are analyzed. Secondly, global sensitivity of APL query under the need of node privacy protection and edge-weighted privacy protection is proved. Finally, the relationship between data availability and privacy control parameters in differential privacy is analyzed through experiments.
DOI10.1109/NaNA.2019.00067
Citation Keytong_topology_2019