Differential Privacy for Edge Weights in Social Networks

Social networks can be analyzed to discover important social issues; however, it will cause privacy disclosure in the process. The edge weights play an important role in social graphs, which are associated with sensitive information (e.g., the price of commercial trade). In the paper, we propose the...

Full description

Bibliographic Details
Main Authors: Xiaoye Li, Jing Yang, Zhenlong Sun, Jianpei Zhang
Format: Article
Language:English
Published: Hindawi-Wiley 2017-01-01
Series:Security and Communication Networks
Online Access:http://dx.doi.org/10.1155/2017/4267921
id doaj-d228569345a24f0aa5c34f158c3f1bc9
record_format Article
spelling doaj-d228569345a24f0aa5c34f158c3f1bc92020-11-25T02:34:43ZengHindawi-WileySecurity and Communication Networks1939-01141939-01222017-01-01201710.1155/2017/42679214267921Differential Privacy for Edge Weights in Social NetworksXiaoye Li0Jing Yang1Zhenlong Sun2Jianpei Zhang3College of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, ChinaSocial networks can be analyzed to discover important social issues; however, it will cause privacy disclosure in the process. The edge weights play an important role in social graphs, which are associated with sensitive information (e.g., the price of commercial trade). In the paper, we propose the MB-CI (Merging Barrels and Consistency Inference) strategy to protect weighted social graphs. By viewing the edge-weight sequence as an unattributed histogram, differential privacy for edge weights can be implemented based on the histogram. Considering that some edges have the same weight in a social network, we merge the barrels with the same count into one group to reduce the noise required. Moreover, k-indistinguishability between groups is proposed to fulfill differential privacy not to be violated, because simple merging operation may disclose some information by the magnitude of noise itself. For keeping most of the shortest paths unchanged, we do consistency inference according to original order of the sequence as an important postprocessing step. Experimental results show that the proposed approach effectively improved the accuracy and utility of the released data.http://dx.doi.org/10.1155/2017/4267921
collection DOAJ
language English
format Article
sources DOAJ
author Xiaoye Li
Jing Yang
Zhenlong Sun
Jianpei Zhang
spellingShingle Xiaoye Li
Jing Yang
Zhenlong Sun
Jianpei Zhang
Differential Privacy for Edge Weights in Social Networks
Security and Communication Networks
author_facet Xiaoye Li
Jing Yang
Zhenlong Sun
Jianpei Zhang
author_sort Xiaoye Li
title Differential Privacy for Edge Weights in Social Networks
title_short Differential Privacy for Edge Weights in Social Networks
title_full Differential Privacy for Edge Weights in Social Networks
title_fullStr Differential Privacy for Edge Weights in Social Networks
title_full_unstemmed Differential Privacy for Edge Weights in Social Networks
title_sort differential privacy for edge weights in social networks
publisher Hindawi-Wiley
series Security and Communication Networks
issn 1939-0114
1939-0122
publishDate 2017-01-01
description Social networks can be analyzed to discover important social issues; however, it will cause privacy disclosure in the process. The edge weights play an important role in social graphs, which are associated with sensitive information (e.g., the price of commercial trade). In the paper, we propose the MB-CI (Merging Barrels and Consistency Inference) strategy to protect weighted social graphs. By viewing the edge-weight sequence as an unattributed histogram, differential privacy for edge weights can be implemented based on the histogram. Considering that some edges have the same weight in a social network, we merge the barrels with the same count into one group to reduce the noise required. Moreover, k-indistinguishability between groups is proposed to fulfill differential privacy not to be violated, because simple merging operation may disclose some information by the magnitude of noise itself. For keeping most of the shortest paths unchanged, we do consistency inference according to original order of the sequence as an important postprocessing step. Experimental results show that the proposed approach effectively improved the accuracy and utility of the released data.
url http://dx.doi.org/10.1155/2017/4267921
work_keys_str_mv AT xiaoyeli differentialprivacyforedgeweightsinsocialnetworks
AT jingyang differentialprivacyforedgeweightsinsocialnetworks
AT zhenlongsun differentialprivacyforedgeweightsinsocialnetworks
AT jianpeizhang differentialprivacyforedgeweightsinsocialnetworks
_version_ 1724806968689819648