Towards identity anonymization on graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 93-106

  Liu, Kun ^a   Terzi, Evimaria ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Anonymity; Degree sequence; Dynamic programming

Indexed keywords

ANONYMITY; ANONYMIZATION; APPLICATION DOMAINS; DEGREE SEQUENCE; DEGREE SEQUENCES; GRAPH G; IDENTIFICATION OF INDIVIDUALS; NETWORK DATUMS; OF GRAPHS; PRIORI KNOWLEDGES; PRIVACY CONCERNS; REAL DATA SETS; REALIZABILITY; SIMPLE AND EFFICIENT ALGORITHMS;

SYSTEMS ENGINEERING;

EID: 57149126815     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376629     Document Type: Conference Paper

References (19)

1. AGGARWAL, C. C, AND YU, P. S. Privacy-Preserving Data Mining: Models and Algorithms, vol. 34 of Advances in Database Systems. Springer, 2008.
2. BACKSTROM. L.. DWORK. C, AND KLEINBERG, J. M. Wherefore art thou R3579X?: Anonymized social networks, hidden patterns, and structural steganography. In Proceedings of the 16th International Conference on World Wide Web (WWW'07) (Alberta, Canada, May 2007), pp. 181-190.
3. BARABÁSI. A.-L.. AND ALBERT, R. Emergence of scaling in random networks. Science 286, 5439 (October 1999), 509-512.
4. BAYARDO, R. J., AND AGRAWAL, R. Data privacy through optimal k-anonymization. In Proceedings of the 21st International Conference on Data Engineering (ICDE'05) (Tokyo, Japan, April 2005), pp. 217-228.
5. CORMEN, T., LEISERSON, C, AND RIVEST, R. Introduction to Algorithms. MIT Press, 1990.
6. ERDÖS, P., AND GALLAI, T. Graphs with prescribed degrees of vertices. Mat. Lapok (1960).
7. FRIKKEN, K. B., AND GOLLE, P. Private social network analysis: How to assemble pieces of a graph privately. In Proceedings of the 5th A CM Workshop on Privacy in Electronic Society (WPES'06) (Alexandria, VA, 2006), pp. 89-98.
8. GETOOR, L., AND DIEHL, C. P. Link mining: a survey. ACM SIGKDD Explorations Newsletter 7, 2 (2005), 3-12.
9. HAKIMI, S. L. On realizability of a set of integers as degrees of the vertices of a linear graph. Journal of the Society for Industrial and Applied Mathematics 10, 3 (1962), 496-506.
10. HAY, M., MIKLAU, G., JENSEN, D., WEIS, P., AND SRIVASTAVA, S. Anonymizing social networks. Technical report, University of Massachusetts Amherst, 2007.
11. LEE, Y.-S. Graphical demonstration of an optimality property of the median. The American Statistician 49, 4 (November 1995), 369-372.
12. MACHANAVAJJHALA, A., GEHRKE, J., KLFER, D., AND VENKITASUBRAMANIAM, M. 1-diversity: Privacy beyond k-anonymity. In Proceedings of the 22nd International Conference on Data Engineering (ICDE'06) (Atlanta, GA, April 2006), p. 24.
13. MEYERSON, A., AND WILLIAMS, R. On the complexity of optimal k-anonymity. In Proceedings of the Twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'04) (Paris, France, 2004), pp. 223-228.
14. PEI, J., AND ZHOU, B. Preserving privacy in social networks against neighborhood attacks. In Proceedings of the 24th International Conference on Data Engineering (ICDE'08) (Cancun, Mexico, April 2008).
15. SAMARATI, P., AND SWEENEY, L. Generalizing data to provide anonymity when disclosing information. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'98) (Seattle, WA, 1998), p. 188.
16. WATTS, D. J. Networks, dynamics, and the small-world phenomenon. American Journal of Sociology 105, 2 (September 1999), 493-527.
17. WATTS, D. J., AND STROGATZ, S. H. Collective dynamics of small-world networks. Nature 393, 6684 (June 1998), 409-410.
18. YING, X., AND WU. X. Randomizing social networks: a spectrum preserving approach. In Proceedings of SIAM International Conference on Data Mining (SDM'08) (Atlanta, GA, April 2008).
19. ZHELEVA, E., AND GETOOR, L. Preserving the privacy of sensitive relationships in graph data. In Proceedings of the International Workshop on Privacy, Security, and Trust in KDD (PinKDD'O7) (San Jose, CA, August 2007).