A Comparative Analysis of Privacy Preserving Techniques in Online Social Networks
Keywords:Online Social Networks (OSNs), Privacy, Communication and Transport (CT), Social Networking Services (SNSs), Distributed Hash Table (DHT), Virtual Individual Server (VIS), Trusted Identification Service (TIS).
The world became a global village due to the great revolution in communication and network fields. The internet eases the communication process all over the world. The social network services, for example; Facebook, that occurred recently are considered one of the most essential and common outcomes due to this revolution. People from different ages, views, cultures, languages, religions, education levels, etc. from all over the world can easily communicate through the social networks. Furthermore; people can share their news and personal information with each other. It can be also noticed that the social network are extensively used, so the privacy issues within it is essentially to be considered. This privacy will prevent any illegal accessing for the user personal information which in turns will increase the users’ conviction to use these networks during their daily life and encourage the other people who have never use the services that are available for using by social networks. This paper analyses several techniques which provides the privacy for Online Social Networks including Reclaim, Safebook, K-Automorphism, Vis-à-vis and SPKA. These techniques are investigated and clarified in terms of their methods in addition to the advantages and drawbacks.
. Nilizadeh, S, Jahid, S and Mittal, P, “Cachet: A Decentralized Architecture for Privacy”, the 8th ACM international Conference on emerging networking experiments and technology, 2012.
. Sun, J, Zhu¢Ó, X and Yuguang Fang, Y, “A Privacy-Preserving Scheme for Online Social Networks with Efficient Revocation”, IEEE INFOCOM, 2010.
. Cutillo, L, Molva, R, Strufey, T and Eurécom, I, “Safebook: a Privacy Preserving Online Social Network Leveraging on Real-Life Trust”, 2007.
. Vijayalakshmi, V, Arunachalam, A and Nandhakumar, R. “Mining Social Media-Utility Based Privacy”, (IJCSIT) International Journal of Computer Science and Information Technologies, 5 (4), 5480-5485, 2014.
. Zeilemaker, N and Pouwelse, J. “ReClaim: a Privacy-Preserving Decentralized Social Network”, 4th USENIX Workshop on Free and Open Communications on the Internet, August 2014.
. Shakimov, A, Lim, H, C´aceres, R, Cox, Li, P, Liu, D and Varshavsky, A. Vis-`a-Vis: Privacy-Preserving Online Social Networking via Virtual Individual Servers. IEEE, 2011.
. Zou, L, Chen, L and Ozsu, M, “KAutomorphism: A General Framework for Privacy Preserving Network Publication”, 2009.
. Poulin,I and Kani, M, “Preserving the Privacy on Social Networks by Clustering Based Anonymization”, International Journal of Advanced Research in Computer Science & Technology (IJARCST), 2 (1), pp.11-14, Jan-March 2014.
. Bloom B. H. Space/Time Trade-Offs nn Hash Coding with Allowable Errors, Communications of the ACM 13, pp. 422–426, July 1970.
. Freedman, M. J., Nissim, K., And Pinkas, B. Efficient Private Matching and Set Intersection, in EUROCRYPT ’04, pp. 1–19, 2014.
. Beato, F., Kohlweiss, M.,and Wouters, K, Scramble! Your Social Network Data, in PETS ’11, vol. 6794 of Lecture Notes in Computer Science, pp. 211–225, 2011.
. Elena Z, Lise G, Privacy in Social Networks: A Survey, in Social Network Data Analytics, pp 277-306, 2011.
. J. Bethencourt, A. Sahai, and B. Waters. Ciphertext-policy attribute-based encryption. In IEEE Security & Privacy, 2007.
. S. Jahid, S. Nilizadeh, P. Mittal, N. Borisov, and A. Kapadia. DECENT: A decentralized architecture for enforcing privacy in online social networks. In SESOC, 2012.