Anonymizing Multiple K-anonymous Shortest Paths for Social Graphs
暂无分享,去创建一个
[1] Lian Liu,et al. Privacy Preservation of Affinities in Social Networks , 2009 .
[2] Ömer Egecioglu,et al. Anonymizing weighted social network graphs , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[3] Jia Liu,et al. K-isomorphism: privacy preserving network publication against structural attacks , 2010, SIGMOD Conference.
[4] Adam Meyerson,et al. On the complexity of optimal K-anonymity , 2004, PODS.
[5] Jeffrey F. Naughton,et al. Anonymization of Set-Valued Data via Top-Down, Local Generalization , 2009, Proc. VLDB Endow..
[6] Kyuseok Shim,et al. Approximate algorithms for K-anonymity , 2007, SIGMOD '07.
[7] Jie Wang,et al. Privacy Preservation in Social Networks with Sensitive Edge Weights , 2009, SDM.
[8] Rajeev Motwani,et al. Anonymizing Unstructured Data , 2008, ArXiv.
[9] Tzung-Pei Hong,et al. Anonymizing Shortest Paths on Social Network Graphs , 2011, ACIIDS.