The extensive growth of Online Social Networks (OSNs) over the last decade has changed the way people interact with their friends, family and especially making new friends. These social networks have been an important integral part of our life. Since the count of the users of social networks is increasing drastically, so is the security threat and also private information threat. For making new friends, some OSNs work on the principle of similar profile attributes to let people become friends. However, this principle involves a privacy threat of exposing private and personal profile information to strangers over the internet. The existing solutions to secure users’ privacy are by finding the intersection of the private set of profile attributes of both the users. These schemes have few flaws and cannot hide users’ privacy. Also, in today’s online social networks any random stranger can send a friend request, check your information and misuse it too. In this paper, the community structures are used to represent the online social networks and asymmetric social proximity measure is used as people consider friendships differently. Because of social closeness measure, friend suggestions and requests originate only from relevant communities. Then, based on the asymmetric social proximity measure, a privacy algorithm is used, which provides a high level of privacy and can protect users’ privacy better than the existing works. This concept is designed using Advanced Encryption Standard Algorithm with the exchange of keys. When there is an exchange of Public and Private keys then only information can be accessed. In this paper, a secured online social network system is designed and developed as a Web application to protect the sensitive data and private information of the users and increase the security and privacy issue for OSNs. This OSN is effective and has high-level privacy protection.

Asymmetric Social Proximity, Community Structure, Online Social Network

[1] Arun Thapa, Ming Li, Sergio Salinas and Pan Li, “Asymmetric Social Proximity Based Private Matching Protocols for Online Social Networks”, IEEE Transactions on Parallel and Distributed Systems.
[2] David Easley and Jon Kleinberg, “Networks, Crowds, and Markets: Reasoning About a Highly Connected World”.
[3] H. Zhu, S. Du, M. Li, and Z. Gao, “Fairness-aware and privacy-preserving friend matching protocol in mobile social networks”, IEEE Transactions on emerging topics in Computing.
[4] X. Liang, M. Barua, R. Lu, X. Lin, and X. Shen, “Health Share: Achieving Secure and Privacy-preserving Health Information Sharing through Health Social Networks”, Computer Communications, Elsevier.
[5] W. Dong, V. Dave, L. Qiu, and Y. Zhang, “Secure Friend Discovery in Mobile Social Networks”, IEEE International Conference on Computer Communications.
[6] J. Camenisch, M. Kohlweiss, A. Rial, and C. Sheedy, “Blind and anonymous identity-based encryption and authorised private Searches on public-key encrypted data”, International Workshop on Public Key Cryptography.
[7] C. Hazay and Y. Lindell, “Efficient Protocols for Set Intersection and Pattern Matching with Security against Malicious and Covert Adversaries”, International Association for Cryptographic Research.