Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

User Vulnerability and Its Reduction on a Social Networking Site

Published: 23 September 2014 Publication History

Abstract

Privacy and security are major concerns for many users of social media. When users share information (e.g., data and photos) with friends, they can make their friends vulnerable to security and privacy breaches with dire consequences. With the continuous expansion of a user’s social network, privacy settings alone are often inadequate to protect a user’s profile. In this research, we aim to address some critical issues related to privacy protection: (1) How can we measure and assess individual users’ vulnerability? (2) With the diversity of one’s social network friends, how can one figure out an effective approach to maintaining balance between vulnerability and social utility? In this work, first we present a novel way to define vulnerable friends from an individual user’s perspective. User vulnerability is dependent on whether or not the user’s friends’ privacy settings protect the friend and the individual’s network of friends (which includes the user). We show that it is feasible to measure and assess user vulnerability and reduce one’s vulnerability without changing the structure of a social networking site. The approach is to unfriend one’s most vulnerable friends. However, when such a vulnerable friend is also socially important, unfriending him or her would significantly reduce one’s own social status. We formulate this novel problem as vulnerability minimization with social utility constraints. We formally define the optimization problem and provide an approximation algorithm with a proven bound. Finally, we conduct a large-scale evaluation of a new framework using a Facebook dataset. We resort to experiments and observe how much vulnerability an individual user can be decreased by unfriending a vulnerable friend. We compare performance of different unfriending strategies and discuss the security risk of new friend requests. Additionally, by employing different forms of social utility, we confirm that the balance between user vulnerability and social utility can be practically achieved.

References

[1]
N. Agarwal, H. Liu, L. Tang, and P. Yu. 2008. Identifying the influential bloggers in a community. In Proceedings of the 1st ACM International Conference on Web Search and Data Mining (WSDM’08). ACM, Palo Alto, CA, USA.
[2]
L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. 2006. Group formation in large social networks: Membership, growth, and evolution. In Proceedings of the 12th ACM SIGKDD. 44--54.
[3]
R. Baden, A. Bender, N. Spring, B. Bhattacharjee, and D. Starin. 2009. Persona: An online social network with user-defined privacy. ACM SIGCOMM Computer Communication Review 39, 4, 135--146.
[4]
G. Becker. 1974. A Theory of Social Interactions.
[5]
D. M. Boyd and N. B. Ellison. 2008. Social network sites: Definition, history, and scholarship. Journal of Computer-Mediated Communication 13, 1, 210--230.
[6]
W. Brock and S. Durlauf. 2001. Discrete choice with social interactions. Review of Economic Studies 68, 2, 235.
[7]
D. Easley and J. Kleinberg. 2010. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press.
[8]
L. Fang and K. LeFevre. 2010. Privacy wizards for social networking sites. In Proceedings of the 19th International World Wide Web Conference (WWW’10).
[9]
M. Garey and D. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co.
[10]
E. Gilbert and K. Karahalios. 2009. Predicting tie strength with social media. In Proceedings of the 27th ACM CHI. 211--220.
[11]
S. Goel, J. M. Hofman, and M. I. Sirer. 2012. Who does what on the web: A large-scale study of browsing behavior. In Proceedings of the 6th International Conference on Weblogs and Social Media (ICWSM’12).
[12]
J. Golbeck, C. Robles, and K. Turner. 2011. Predicting personality with social media. In CHI Extended Abstracts on Human Factors in Computing Systems. CHI EA. 253--262.
[13]
R. Goolsby. 2010. Social media as crisis platform: The future of community maps/crisis maps. ACM Transactions on Intelligent System Technology 1, 1, 1--11.
[14]
R. Gross and A. Acquisti. 2005. Information revelation and privacy in online social networks. In Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM, 71--80.
[15]
P. Gundecha, G. Barbier, and H. Liu. 2011. Exploiting vulnerability to secure user privacy on a social networking site. In Proceedings of the 17th ACM SIGKDD.
[16]
P. Gundecha and H. Liu. 2012. Mining social media: A brief introduction. Tutorials in Operations Research 1, 4.
[17]
P. Gundecha, S. Ranganath, Z. Feng, and H. Liu. 2013. A tool for collecting provenance data in social media. In Proceedings of the 19th ACM SIGKDD. ACM, 1462--1465.
[18]
J. Hu, H.-J. Zeng, H. Li, C. Niu, and Z. Chen. 2007. Demographic prediction based on user’s browsing behavior. In Proceedings of the 16th International Conference on World Wide Web (WWW’07). 151--160.
[19]
M. Kosinski, D. Stillwell, and T. Graepel. 2013. Private traits and attributes are predictable from digital records of human behavior. Proceedings of the National Academy of Sciences 110, 15, 5802--5805.
[20]
B. Krishnamurthy and C. Wills. 2010. On the leakage of personally identifiable information via online social networks. ACM SIGCOMM Computer Communication Review 40, 1, 112--117.
[21]
J. Leskovec, L. Adamic, and B. Huberman. 2007. The dynamics of viral marketing. ACM Transactions on the Web (TWEB) 1, 1.
[22]
H. Liu and P. Maes. 2005. Interestmap: Harvesting social network profiles for recommendations. Beyond Personalization-IUI2005, January 9, San Diego, CA, USA.
[23]
G. Loewenstein, L. Thompson, and M. Bazerman. 1989. Social utility and decision making in interpersonal contexts. Journal of Personality and Social Psychology 57, 3, 426.
[24]
B. Marcus, F. Machilek, and A. Schutz. 2006. Personality in cyberspace: Personal web sites as media for personality expressions and impressions. Journal of Personality and Social Psychology 90, 6, 1014--1031.
[25]
E. Morozov. 2011. The Net Delusion: The Dark Side of Internet Freedom. Public Affairs.
[26]
A. Narayanan and V. Shmatikov. 2008. Robust de-anonymization of large sparse datasets. In Proceedings of the 29th IEEE Symposium on Security and Privacy.
[27]
A. Narayanan and V. Shmatikov. 2009. De-anonymizing social networks. In Proceedings of the 30th IEEE Symposium on Security and Privacy.
[28]
G. Nemhauser, L. Wolsey, and M. Fisher. 1978. An analysis of approximations for maximizing submodular set functions. Mathematical Programming 14, 1, 265--294.
[29]
T. Parsons. 1968. Social interaction. International Encyclopedia of the Social Sciences 7, 429--441.
[30]
D. Quercia, M. Kosinski, D. Stillwell, and J. Crowcroft. 2011. Our Twitter profiles, our selves: Predicting personality with Twitter. In Proceedings of the 2011 IEEE 3rd International Conference on Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE 3rd International Conference on Social Computing SocialCom). 180--185.
[31]
P. J. Rentfrow and S. D. Gosling. 2003. The do re mi’s of everyday life: The structure and personality correlates of music preferences. Journal of Personality and Social Psychology 84, 6, 1236--1256.
[32]
D. Rosenblum. 2007. What anyone can know: The privacy risks of social networking sites. IEEE Security and Privacy, 40--49.
[33]
C. Sibona and S. Walczak. 2011. Unfriending on Facebook: Friend request and online/offline behavior analysis. In Proceedings of the 44th Hawaii International Conference on System Sciences.
[34]
A. Squicciarini, M. Shehab, and F. Paci. 2009. Collective privacy management in social networks. In Proceedings of the 18th International Conference on World Wide Web (WWW’09).
[35]
J. Sterne. 2010. Social Media Metrics. The New Rules of Social Media. John Wiley & Sons Inc.
[36]
M. R. Subramani and B. Rajagopalan. 2003. Knowledge-sharing and influence in online social networks via viral marketing. Communications of the ACM 46, 12, 300--307.
[37]
M. Sviridenko. 2004. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters 32, 1, 41--43.
[38]
J. Tang, Y. Chang, and H. Liu. 2014. Mining social media with social theories: A survey. SIGKDD Explorations.
[39]
L. Tang and H. Liu. 2009. Relational learning via latent social dimensions. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[40]
L. Tang, H. Liu, J. Zhang, and Z. Nazeri. 2008. Community evolution in dynamic multi-mode networks. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[41]
H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos. 2012. Gelling, and melting, large graphs by edge manipulation. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management.
[42]
H. Tong, B. A. Prakash, C. Tsourakakis, T. Eliassi-Rad, C. Faloutsos, and D. H. Chau. 2010. On the vulnerability of large graphs. In Proceedings of the 10th IEEE International Conference on Data Mining. 1091--1096.
[43]
G. Vaynerchuk. 2009. Crush It!: Why Now Is the Time to Cash in on Your Passion (1st ed.). HarperCollins.
[44]
V. Vazirani. 2001. Approximation Algorithms. Springer.
[45]
T. Veblen and M. Banta. 2007. The Theory of the Leisure Class. Oxford University Press.
[46]
D. Watts and S. Strogatz. 1998. Collective dynamics of small-world networks. Nature 393, 6684, 440--442.
[47]
G. Wondracek, T. Holz, E. Kirda, and C. Kruegel. 2010. A practical attack to de-anonymize social network users. In Proceedings of the 31st IEEE Symposium on Security and Privacy.
[48]
X. Ying and X. Wu. 2008. Randomizing social networks: A spectrum preserving approach. In Proceedings of the SIAM International Conference on Data Mining.
[49]
R. Zafarani, M. A. Abbasi, and H. Liu. 2014. Social Media Mining: An Introduction. Cambridge University Press.
[50]
R. Zafarani and H. Liu. 2009. Connecting corresponding identities across communities. In Proceedings of the 3rd ICWSM.
[51]
R. Zafarani and H. Liu. 2013. Connecting users across social media sites: A behavioral-modeling approach. In Proceedings of the 19th ACM SIGKDD. ACM, 41--49.
[52]
E. Zheleva and L. Getoor. 2009. To join or not to join: The illusion of privacy in social networks with mixed public and private user profiles. In Proceedings of the the 18th International World Wide Web Conference (WWW’09).

Cited By

View all
  • (2024)Developing an AI-Driven Chatbot for Enhanced College Website Support Using Machine Learning2024 International Conference on Expert Clouds and Applications (ICOECA)10.1109/ICOECA62351.2024.00130(719-726)Online publication date: 18-Apr-2024
  • (2023)Data Level Privacy Preserving: A Stochastic Perturbation Approach Based on Differential PrivacyIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2021.313704735:4(3619-3631)Online publication date: 1-Apr-2023
  • (2022)Social Network and Data Security IssuesInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology10.32628/CSEIT228219(149-154)Online publication date: 28-Mar-2022
  • Show More Cited By

Index Terms

  1. User Vulnerability and Its Reduction on a Social Networking Site

      Recommendations

      Reviews

      Amos O Olagunju

      Social media users sometimes expose their friends to confidentiality and safety breaches. To what extent are companionable users vulnerable to security breaches in social networking sites__?__ How should access to social networks and security risks be balanced for individual friendly users__?__ Gundecha and others investigate these fascinating questions. The theory of vulnerability and its reduction in social networks in this paper is predicated on privacy settings that reveal the personal information of users, and unintended consequential actions by users and friends that reveal information about other friends and family members. The individual (I-index) vulnerability of each attribute in the profile of a user is the degree to which the user enables it to be visible to others in a social network. A user poses the risk of divulging an attribute of friendly users in a profile community (C-index) to the extent to which all other users of a social network can trace the attribute. The nonvisible privacy or visible publicity (P-index) vulnerability is a measure of the degree to which the users protect themselves and friends in a social network. The vulnerability (V-index) of users relies on their own privacy settings, as well as those of their friends and families in a social network. The authors use the pertinent information from the I-index, C-index, P-index, and V-index of users to derive theorems and equations for computing the most vulnerable friends to defriend, to maximize vulnerability and minimize the losses of each user in social networking sites. They perform a variety of experiments with a Facebook dataset to investigate the accuracy of the vulnerability reduction measures and algorithms. The results reveal that the proposed alternative strategies for defriending at least the most vulnerable friend would make all social contact users at least more secure to vulnerabilities. Undeniably, shoddy users who make new friends on social networks can become more vulnerable. The authors provide numerous approaches for pinpointing the utmost number of susceptible friends to defriend, to reduce vulnerability and the risk of losing social network contacts at suitable levels. I strongly encourage all managers of social networking sites to use the insightful ideas in this paper to investigate user vulnerabilities across networks. Online Computing Reviews Service

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Transactions on Knowledge Discovery from Data
      ACM Transactions on Knowledge Discovery from Data  Volume 9, Issue 2
      November 2014
      193 pages
      ISSN:1556-4681
      EISSN:1556-472X
      DOI:10.1145/2672614
      Issue’s Table of Contents
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 23 September 2014
      Accepted: 01 May 2014
      Revised: 01 March 2014
      Received: 01 August 2012
      Published in TKDD Volume 9, Issue 2

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Vulnerability
      2. privacy
      3. social network

      Qualifiers

      • Research-article
      • Research
      • Refereed

      Funding Sources

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)26
      • Downloads (Last 6 weeks)5
      Reflects downloads up to 12 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Developing an AI-Driven Chatbot for Enhanced College Website Support Using Machine Learning2024 International Conference on Expert Clouds and Applications (ICOECA)10.1109/ICOECA62351.2024.00130(719-726)Online publication date: 18-Apr-2024
      • (2023)Data Level Privacy Preserving: A Stochastic Perturbation Approach Based on Differential PrivacyIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2021.313704735:4(3619-3631)Online publication date: 1-Apr-2023
      • (2022)Social Network and Data Security IssuesInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology10.32628/CSEIT228219(149-154)Online publication date: 28-Mar-2022
      • (2022)Individual Attribute and Cascade Influence Capability-Based Privacy Protection Method in Social NetworksSecurity and Communication Networks10.1155/2022/63381232022Online publication date: 1-Jan-2022
      • (2021)Privacy and Security Matters Related To Use Of Mobile Devices and Social MediaSoutheastCon 202110.1109/SoutheastCon45413.2021.9401838(1-6)Online publication date: 10-Mar-2021
      • (2020)Investigation of User Vulnerability in Social Networking SiteData Science: New Issues, Challenges and Applications10.1007/978-3-030-39250-5_12(219-234)Online publication date: 13-Feb-2020
      • (2019)A Survey on Interdependent PrivacyACM Computing Surveys10.1145/336049852:6(1-40)Online publication date: 16-Oct-2019
      • (2018)Latent-Data Privacy Preserving With Customized Data Utility for Social Network DataIEEE Transactions on Vehicular Technology10.1109/TVT.2017.273801867:1(665-673)Online publication date: Jan-2018
      • (2017)Security Risk Estimation of Social Network Privacy IssueProceedings of the 2017 7th International Conference on Communication and Network Security10.1145/3163058.3163073(81-85)Online publication date: 24-Nov-2017
      • (2016)Colour as an Indicator of Vulnerability of Users Within Social NetworksInternational Journal of Sociotechnology and Knowledge Development10.4018/IJSKD.20160101048:1(56-69)Online publication date: 1-Jan-2016
      • Show More Cited By

      View Options

      Get Access

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media