This Article 
 Bibliographic References 
 Add to: 
Preserving Relation Privacy in Online Social Network Data
May/June 2011 (vol. 15 no. 3)
pp. 35-42
Na Li, University of Texas at Arlington
Nan Zhang, George Washington University
Sajal K. Das, University of Texas at Arlington

Online social networks routinely publish data of interest to third parties, but in so doing often reveal relationships, such as a friendship or contractual association, that an attacker can exploit. This systematic look at existing privacy-preservation techniques highlights the vulnerabilities of users even in networks that completely anonymize identities. Through a taxonomy that categorizes techniques according to the degree of user identity exposure, the authors examine the ways that existing approaches compromise relation privacy and offer more secure alternatives.

1. N.B. Ellison, C. Steinfield, and C. Lampe, "The Benefits of Facebook 'Friends:' Social Capital and College Students' Use of Online Social Network Sites," J. Computer-Mediated Communication, vol. 12, no. 4, 2007, pp. 1143–1168.
2. L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore Art Thou r3579x?: Anonymized Social Networks, Hidden Patterns, and Structural Steganography," Proc. 16th Int'l Conf. World Wide Web, ACM Press, 2007, pp. 181–190.
3. K. Liu and E. Terzi, "Towards Identity Anonymization on Graphs," Proc. SIGMOD, ACM Press, 2008, pp. 93–106.
4. B. Zhou and J. Pei, "Preserving Privacy in Social Networks against Neighborhood Attacks," Proc 24th IEEE Int'l Conf. Data Engineering, IEEE CS Press, 2008, pp. 506–515.
5. L. Zou, L. Chen, and M.T. Ozsu, "K-Automorphism: A General Framework for Privacy Preserving Network Publication," Proc. Very Large Database Endowment, Aug. 2009, pp. 946–957.
6. J. Cheng, A. Fu, and J. Liu, "K-Isomorphism: Privacy Preservation in Network Publication against Structural Attack," Proc. SIGMOD, ACM Press, 2010, pp. 459–470.
7. A. Campan and T.M. Truta, "A Clustering Approach for Data and Structural Anonymity in Social Networks," LNCS 5456, Springer, 2009, pp. 33–54.
8. M. Hay et al., "Resisting Structural Reidentification in Anonymized Social Networks," Proc. Very Large Databases Endowment, vol. 1, no. 1, 2008, pp. 102–114.
9. E. Zheleva and L. Getoor, "Preserving the Privacy of Sensitive Relationships in Graph Data," Proc. 1st ACM SIGKDD Int'l Workshop Privacy, Security, and Trust in KDD (PinKDD 07), ACM Press, 2007, pp. 153–171.
10. S. Bhagat et al., "Class-Based Graph Anonymization for Social Network Data," Proc. Very Large Databases Endowment, vol. 2, no. 1, 2009, pp. 766–777.
11. G. Cormode et al., "Anonymizing Bipartite Graph Data Using Safe Groupings, Int'l J. Very Large Databases, vol. 19, no. 1, 2010, pp. 115–139.
12. N. Li, N. Zhang, and S. Das, Relationship Privacy Preservation in Publishing Online Social Networks, tech. report CSE-2011-1, Computer Science and Engineering Dept., Univ. of Texas at Arlington, 2011.
13. L. Liu et al., Privacy Preserving in Social Networks against Sensitive Edge Disclosure, tech. report CMIDA-HiPSCCS 006-08, Computer Science Dept., Univ. of Kentucky, 2008.
14. S. Das, O. Egecioglu, and A. El Abbadi, Anonymizing Edge-Weighted Social Network Graphs, tech. report CS-2009-03, Computer Science Dept., Univ. of California, Santa Barbara, 2009.
15. T. Li and N. Li, "On the Tradeoff between Privacy and Utility in Data Publishing," Proc. 16th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, ACM Press, 2009, pp. 517–526.

Index Terms:
Keywords: relation privacy, online social networks, user privacy, utility loss.
Na Li, Nan Zhang, Sajal K. Das, "Preserving Relation Privacy in Online Social Network Data," IEEE Internet Computing, vol. 15, no. 3, pp. 35-42, May-June 2011, doi:10.1109/MIC.2011.26
Usage of this product signifies your acceptance of the Terms of Use.