Privacy protection in social networks using l-diversity

Authors:
Liangwen Yu;Jiawei Zhu;Zhengang Wu;Tao Yang;Jianbin Hu;Zhong Chen
Affiliations:
Institute of Software, School of EECS, Peking University, China,MoE Key Lab of High Confidence Software Technologies (PKU), China,MoE Key Lab of Network and Software Security Assurance (PKU), Chin ...;Institute of Software, School of EECS, Peking University, China,MoE Key Lab of High Confidence Software Technologies (PKU), China,MoE Key Lab of Network and Software Security Assurance (PKU), Chin ...;Institute of Software, School of EECS, Peking University, China,MoE Key Lab of High Confidence Software Technologies (PKU), China,MoE Key Lab of Network and Software Security Assurance (PKU), Chin ...;Institute of Software, School of EECS, Peking University, China,MoE Key Lab of High Confidence Software Technologies (PKU), China,MoE Key Lab of Network and Software Security Assurance (PKU), Chin ...;Institute of Software, School of EECS, Peking University, China,MoE Key Lab of High Confidence Software Technologies (PKU), China,MoE Key Lab of Network and Software Security Assurance (PKU), Chin ...;Institute of Software, School of EECS, Peking University, China,MoE Key Lab of High Confidence Software Technologies (PKU), China,MoE Key Lab of Network and Software Security Assurance (PKU), Chin ...
Venue:
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Year:
2012

Citing 13
Cited 0

k-anonymity: a model for protecting privacy

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Anatomy: simple and effective privacy preservation

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
L-diversity: Privacy beyond k-anonymity

ACM Transactions on Knowledge Discovery from Data (TKDD)
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography

Proceedings of the 16th international conference on World Wide Web
Towards identity anonymization on graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Resisting structural re-identification in anonymized social networks

Proceedings of the VLDB Endowment
Anonymizing bipartite graph data using safe groupings

Proceedings of the VLDB Endowment
Preserving Privacy in Social Networks Against Neighborhood Attacks

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Class-based graph anonymization for social network data

Proceedings of the VLDB Endowment
k-automorphism: a general framework for privacy preserving network publication

Proceedings of the VLDB Endowment
Preserving the privacy of sensitive relationships in graph data

PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks

Knowledge and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the increasing popularity of online social networks, such as twitter and weibo, privacy preserving publishing of social network data has raised serious concerns. In this paper, we focus on the problem of preserving the sensitive attribute of the node in social network data. We call a graph l-diversity anonymous if all the same degree nodes in the graph form a group in which the frequency of the most frequent sensitive value is at most $\frac{1}{l}$. To achieve this objective, we devise an efficient heuristic algorithm via graphic l-diverse partition and also use three anonymous strategies(AdjustGroup, RedirectEdges, AssignResidue)to optimize the heuristic algorithm. Finally, we verify the effectiveness of the algorithm through experiments.