Elena Zheleva
ABSTRACT
In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose practical models that use friendship and group membership information (which is often not hidden) to infer sensitive attributes. The key novel idea is that in addition to friendship links, groups can be carriers of significant information. We show that on several well-known social media sites, we can easily and accurately recover the information of private-profile users. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks with mixed public and private user profiles.
- G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation algorithms for k--anonimity. JPT, Nov. 2005.Google Scholar
- E. Airoldi, D. Blei, S. Fienberg, and E. Xing. Mixed-membership stochastic blockmodels. JMLR, 9:1981--2014, 2008. Google ScholarDigital Library
- L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x: anonymized social networks, hidden patterns, and struct. steganography. In WWW, 2007. Google ScholarDigital Library
- D. Baldassarri and A. Gelman. Partisans without constraint: Political polarization and trends in american public opinion. American Journal of Sociology, 114(2):408--446, September 2008.Google ScholarCross Ref
- R. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE, April 2005. Google ScholarDigital Library
- C. Dwork. Differential privacy. In ICALP, 2006. L. Getoor and B. Taskar, editors. Introduction to statistical relational learning. MIT Press, 2007.Google ScholarDigital Library
- M. Hay, G. Miklau, D. Jensen, and D. Towsley. Resisting structural identification in anonymized social networks. In VLDB, August 2008. Google ScholarDigital Library
- J. He, W. Chu, and Z. Liu. Inferring privacy information from social networks. In ISI, 2006. Google ScholarDigital Library
- K. Lewis, J. Kaufman, M. Gonzalez, A. Wimmer, and N. Christakis. Tastes, ties, and time. hd l:1902.1/11827.Google Scholar
- N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anon. and l-diversity. In ICDE, 2007.Google ScholarCross Ref
- D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins. Geographic routing in social networks. PNAS, 102(33):11623--11628, August 2005.Google ScholarCross Ref
- J. Lindamood, R. Heatherly, M. Kantarcioglu, and B. Thuraisingham. Inferring private information using social network data. In WWW Poster, 2009. Google ScholarDigital Library
- H. Liu and L. Yu. Toward integrating feature selection algorithms for classification and clustering. TKDE, 17(4):491--502, April 2005. Google ScholarDigital Library
- K. Liu and E. Terzi. Towards identity anonymization on graphs. In SIGMOD, 2008. Google ScholarDigital Library
- A. Machanava jjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In ICDE, 2006.Google Scholar
- S. Macskassy and F. Provost. Classification in networked data: A toolkit and a univariate case study. JMLR, 8:935--983, May 2007. Google ScholarDigital Library
- A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. S&P, 2008. Google ScholarDigital Library
- M. E. Nergiz and C. Clifton. Multirelational k-anonymity. In ICDE, April 2007.Google ScholarCross Ref
- J. Neville and D. Jensen. Leveraging relational autocorrelation with latent group models. In ICDM, 2005. Google ScholarDigital Library
- P. Sen, G. M. Namata, M. Bilgic, L. Getoor, B. Gallagher, and T. Eliassi--Rad. Collective classification in network data. Technical Report CS-TR-4905, Univ. of Maryland, 2008.Google ScholarCross Ref
- L. Sweeney. Achieving k-anonymity privacy protection using generalization and suppression. IJU, 10(5), 2002. Google ScholarDigital Library
- I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun. Support vector learning for interdependent and structured output spaces. ICML, 2004. Google ScholarDigital Library
- Y. Wang and G. Wong. Stochastic blockmodels for directed graphs. JASA, 1987.Google ScholarCross Ref
- E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. PinKDD, 2007. Google ScholarDigital Library
Index Terms
- To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles
Recommendations
curso: protect yourself from curse of attribute inference: a social network privacy-analyzer
DBSocial '13: Proceedings of the ACM SIGMOD Workshop on Databases and Social NetworksWhile social networking platforms allow users to control how their private information is shared, recent research has shown that a user's sensitive attribute can be inferred based on friendship links and group memberships, even when the attribute value ...
Preventing sensitive relationships disclosure for better social media preservation
A fundamental aspect of all social networks is information sharing. It is one of the most common forms of online interaction that is tightly associated with social media preservation and information disclosure. As such, information sharing is commonly ...
Graph publication when the protection algorithm is available
With the popularity of social networks, the privacy issues related with social network data become more and more important. The connection information between users, as well as their sensitive attributes, should be protected. There are some proposals ...
Comments