A reputation-based privacy management system for social networking sites

Social networking sites form a special type of virtual community where we share our personal information with people and develop new relationships on the Internet. These sites allow the users to share just about everything, including photos, videos, favorite music, and games, and record all user interactions and retain them for potential use in social data mining. This storing and sharing of large amounts of information causes privacy problems for the users of these websites. In order to prevent these problems, we have to provide strict privacy policies, data protection mechanisms, and trusted and built-in applications that help to protect user privacy by limiting the people who get access to a user's personal information. Thus, the privacy problem has prompted us to provide a solution that offers the users of these social networking websites an opportunity to protect their information. In this paper, a social networking application and its system design, algorithm, and database structure are described. Our application offers a reputation-based trusted architecture to social network users. It creates and monitors social reputations, finds social circles, and helps the users to group their friends easily, meaningfully, and automatically to protect their privacy. This system provides the grouping of users through an automated system into different social circles by analyzing the user's social connections depending on what common information or application they share that should not be accessed by other users.

A reputation-based privacy management system for social networking sites

Social networking sites form a special type of virtual community where we share our personal information with people and develop new relationships on the Internet. These sites allow the users to share just about everything, including photos, videos, favorite music, and games, and record all user interactions and retain them for potential use in social data mining. This storing and sharing of large amounts of information causes privacy problems for the users of these websites. In order to prevent these problems, we have to provide strict privacy policies, data protection mechanisms, and trusted and built-in applications that help to protect user privacy by limiting the people who get access to a user's personal information. Thus, the privacy problem has prompted us to provide a solution that offers the users of these social networking websites an opportunity to protect their information. In this paper, a social networking application and its system design, algorithm, and database structure are described. Our application offers a reputation-based trusted architecture to social network users. It creates and monitors social reputations, finds social circles, and helps the users to group their friends easily, meaningfully, and automatically to protect their privacy. This system provides the grouping of users through an automated system into different social circles by analyzing the user's social connections depending on what common information or application they share that should not be accessed by other users.

___

  • B. Zhou, J. Pei, “Preserving privacy in social networks against neighborhood attacks”, Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pp. 506–515, 2008.
  • A. Acquisti, R. Gross, “Imagined communities: awareness, information sharing, and privacy on the Facebook”, Proceedings of the 6th International Conference on Privacy Enhancing Technologies, Vol. 4258, pp. 36–58, 2006.
  • J. Lindamood, M. Kantarcioglu, “Inferring private information using social network data”, University of Texas at Dallas Technical Report, 2008.
  • A.H. Wang, “Detecting spam bots in online social networking sites: a machine learning approach”, Proceedings of the 24th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy, Vol. 6166, pp. 335–342, 2010.
  • B. Markines, C. Cattuto, F. Menczer, “Social spam detection”, Proceedings of the 5th International Workshop on Adversarial Information Retrieval on the Web, pp. 41–48, 2009.
  • H.Y. Lam, D.Y. Yeung, “A learning approach to spam detection based on social networks”, Proceedings of the 4th Conference on Email and AntiSpam, pp. 81–89, 2007.
  • G. Stringhini, C. Kruegel, G. Vigna, “Detecting spammers on social networks”, Proceedings of the 26th Annual Computer Security Applications Conference, pp. 1–9, 2010.
  • F. Benevenuto, G. Magno, T. Rodrigues, V. Almeida, “Detecting spammers on Twitter”, Proceedings of the 7th Annual Collaboration, Electronic Messaging, Anti-Abuse and Spam Conference, pp. 1–9, 2010.
  • M. Sirivianos, K. Kim, X. Yang, “FaceTrust: assessing the credibility of online personas via social networks”, Proceedings of the 4th USENIX Conference on Hot Topics in Security, pp. 1–6, 2009.
  • E. Denham, “Report of findings into the complaint filed by the Canadian Internet Policy and Public Interest Clinic (CIPPIC) against Facebook Inc. under the Personal Information Protection and Electronic Documents Act”, Technical Report, Office of the Privacy Commissioner of Canada, pp. 1–113, 2009.
  • E. Zheleva, L. Getoor, “To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles”, The 18th International Conference on World Wide Web, pp. 531–540, 2009.
  • F. Adu-Oppong, C.K. Gardiner, A. Kapadia, P.P. Tsang, “Social circles: tackling privacy in social networks”, Proceedings of the 4th Symposium on Usable Privacy and Security, 2008.
  • E.A. Baatarjav, R. Dantu, S. Phithakkitnukoon, “Privacy management for Facebook”, 4th International Conference on Information Systems Security, Information Systems Security, Vol. 5352, pp. 273–286, 2008.
  • K. Scholz, “Using force directed graphs in your app”, available at http://www.Kylescholz.com/blog/2006/06/using force directed graphs.html, 8 June 2006. Last accessed 16 March 20
  • MyFICO, http://www.myfico.com/CreditEducation/WhatsInYourScore.aspx, 2012. Last accessed 16 March 2012. Carfax, http://www.carfax.com/, 2012. Last accessed 16 March 2012.
  • AutoCheck, http://www.autocheck.com/consumers/gatewayAction.do?siteID = 0&WT.mc id = 0, 2012. Last accessed 16 March 2012.
  • M. Antonakakis, R. Perdisci, D. Dagon, W. Lee, N. Feamster, “Building a Dynamic Reputation System for DNS”, Proceedings of the 19th USENIX Conference on Security, pp. 273–290, 2010.
  • S. Hao, N.A. Syed, N. Feamster, A.G. Gray, S. Krasser, “Detecting spammers with SNARE: spatio-temporal network-level automatic reputation engine”, Proceedings of the 18th USENIX Security Symposium, pp. 101–118, 200 S. Sarıel, T. Akg¨ un, “A model for user profiling systems with interacting agents”, Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 13, pp. 311–332, 2005.
  • M. Kaya, “An algorithm for image clustering and compression”, Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 13, pp. 79–92, 2005.
  • N. Mishra, R. Schreiber, I. Stanton, R.E. Tarjan, “Clustering social networks”, Proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph, Vol. 4863, pp. 56–67, 2007.
  • Neo4j, “Neo4j: the graph database”, available at http://neo4j.org/, 2012. Last accessed 16 March 2012.
  • M.A. Rodrigez, “MySQL vs. Neo4j on a large-scale graph traversal”, available at http://markorodriguez.com/2011/02/18/mysql-vs-neo4j-on-a-large-scale-graph-traversal/, 2011. Last accessed 16 March 2012.
  • C. Vicknair, M. Macias, Z. Zhao, X. Nan, Y. Chen, D. Wilkins, “A comparison of a graph database and a relational database: a data provenance perspective”, Proceedings of the 48th ACM Southeast Conference, pp. 42–47, 2010.
Turkish Journal of Electrical Engineering and Computer Science-Cover
  • ISSN: 1300-0632
  • Yayın Aralığı: Yılda 6 Sayı
  • Yayıncı: TÜBİTAK