Injecting uncertainty in graphs for identity obfuscation

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1376-1387

  Boldi, Paolo ^a   Bonchi, Francesco ^b   Gionis, Aristides ^b   Tassa, Tamir ^c  

^a UNIVERSITY OF MILAN   (Italy)

^b YAHOO RESEARCH   (Spain)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLISHING;

PRIVACY BREACHES; PRIVACY CONCERNS; RANDOMIZED METHOD; REAL-WORLD NETWORKS; SOCIAL GRAPHS; SOCIAL NETWORKING APPLICATIONS; SOCIAL STRUCTURE; UNCERTAIN GRAPHS;

GRAPHIC METHODS;

EID: 84873206350     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350254     Document Type: Article

References (38)

1. O. Abul, F. Bonchi, and M. Nanni. Never walk alone: Uncertainty for anonymity in moving objects Databases. In ICDE, pages 376-385, 2008.
2. L. Backstrom, C. Dwork, and J. M. Kleinberg. Wherefore art thou r3579x: anonymized social networks, hidden patterns, and structural steganography. In WWW, pages 181-190, 2007.
3. P. Boldi, M. Rosa, and S. Vigna. HyperANF: Approximating the neighbourhood function of very large graphs on a budget. In WWW, pages 625-634, 2011.
4. F. Bonchi, A. Gionis, and T. Tassa. Identity obfuscation in graphs through the information theoretic lens. In ICDE, pages 924-935, 2011.
5. A. Campan and T. Truta. A clustering approach for data and structural anonymity in social networks. In PinKDD, pages 33-54, 2008.
6. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55(3):441-453, 1997.
7. G. Cormode, D. Srivastava, S. Bhagat, and B. Krishnamurthy. Class-based graph anonymization for social network data. PVLDB, 2(1):766-777, 2009.
8. G. Cormode, D. Srivastava, T. Yu, and Q. Zhang. Anonymizing bipartite graph data using safe groupings. PVLDB, 1(1):833-844, 2008.
9. P. Crescenzi, R. Grossi, L. Lanzi, and A. Marino. A comparison of three algorithms for approximating the distance distribution in real-world graphs. In TAPAS, pages 92-103, 2011.
10. M. Hay, G. Miklau, D. Jensen, D. F. Towsley, and C. Li. Resisting structural re-identification in anonymized social networks. VLDB Journal, 19(6):797-823, 2010.
11. M. Hay, G. Miklau, D. Jensen, D. F. Towsley, and P. Weis. Resisting structural re-identification in anonymized social networks. In PVLDB, 1(1):102-114, 2008.
12. M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. University of Massachusetts Technical Report, 07(19), 2007.
13. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
14. R. Jin, L. Liu, and C. C. Aggarwal. Discovering highly reliable subgraphs in uncertain graphs. In KDD, pages 992-1000, 2011.
15. R. Jin, L. Liu, B. Ding, and H. Wang. Distance-constraint reachability computation in uncertain graphs. PVLDB, 4(9):551-562, 2011.
16. O. Kallenberg. Foundations of Modern Probability. Springer Series in Statistics, second edition, 2002.
17. U. Kang, C. E. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. HADI: Mining radii of large graphs. ACM Transactions on Knowledge Discovery from Data, 5(2):8, 2011.
18. R. J. Lipton and J. F. Naughton. Query size estimation by adaptive sampling. Journal of Computer and System Sciences, 51(1):18-25, 1995.
19. K. Liu and E. Terzi. Towards identity anonymization on graphs. In SIGMOD Conference, pages 93-106, 2008.
20. M. Marchiori and V. Latora. Harmony in the small-world. Physica A, 285:539-546, 2000.
21. N. Medforth and K. Wang. Privacy risk in graph stream publishing for social network data. In ICDM, pages 437-446, 2011.
22. A. Narayanan and V. Shmatikov. De-anonymizing social networks. In IEEE Symposium on Security and Privacy, pages 173-187, 2009.
23. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. Anf: a fast and scalable tool for data mining in massive graphs. In KDD, pages 81-90, 2002.
24. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-Nearest neighbors in uncertain graphs. PVLDB, 3(1):997-1008, 2010.
25. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information (abstract). In PODS, page 188, 1998.
26. J. Shao and D. Tu. The jackknife and bootstrap. Springer series in statistics, 1995.
27. T. Snijders. The degree variance: An index of graph heterogeneity. Social Networks, 3(3):163-174, 1981.
28. L. Sweeney. Achieving k-anonymity privacy protection using generalization and suppression. International Journal on Uncertainty Fuzziness and Knowledge-based Systems, 10(5):571-588, 2002.
29. T. Tassa and D. Cohen. Anonymization of centralized and distributed social networks by sequential clustering. IEEE Transactions on Knowledge and Data Engineering, 2012.
30. B. Thompson and D. Yao. The union-split algorithm and cluster-based anonymization of social networks. In ASIACCS, pages 218-227, 2009.
31. W. Wu, Y. Xiao, W. Wang, Z. He, and Z. Wang. k-Symmetry model for identity anonymization in social networks. In EDBT, pages 111-122, 2010.
32. X. Ying, K. Pan, X. Wu, and L. Guo. Comparisons of randomization and k-degree anonymization schemes for privacy preserving social network publishing. In SNA-KDD, pages 1-10, 2009.
33. E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationship in graph data. In PinKDD, pages 153-171, 2007.
34. B. Zhou and J. Pei. Preserving privacy in social networks against neighborhood attacks. In ICDE, pages 506-515, 2008.
35. L. Zou, L. Chen, and M. T. Özsu. K-automorphism: A general framework for privacy preserving network publication. PVLDB, 2(1):946-957, 2009.
36. Z. Zou, H. Gao, and J. Li. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In KDD, pages 633-642, 2010.
37. Z. Zou, J. Li, H. Gao, and S. Zhang. Finding top-k maximal cliques in an uncertain graph. In ICDE, pages 649-652, 2010.
38. Z. Zou, J. Li, H. Gao, and S. Zhang. Mining frequent subgraph patterns from uncertain graph data. IEEE Transactions on Knowledge and Data Engineering, 22(9):1203-1218, 2010.