IJIRST –International Journal for Innovative Research in Science & Technology| Volume 2 | Issue 11 | April 2016 ISSN (online): 2349-6010 All rights reserved by www.ijirst.org 420 Privacy Control Protocol for Post Sharing in Online Social Network’s using Cosine Similarity and Set Intersection K. Sarath Kumar V.M.Priyadharshini P.G. Student Assistant Professor Department of Computer Science & Engineering Department of Computer Science & Engineering University College of Engineering, Anna University, BIT University College of Engineering, Anna University, BIT campus, Tiruchirappalli, India campus, Tiruchirappalli, India Abstract The internet is being integrated into nearly every aspect of daily life of individuals. Social networks are made up of user profiles which are a collection of user’s personal data and its relation to other users. Many relations between users are based on trust but trust and privacy are not captured and presented in profiles and personalized recommendations. An efficient privacy protection mechanism is important for OSNs that can be used to protect the privacy of online social relationships and users’ data from third parties. Post sharing is one of the important aspects of an online social network. Sharing such data requires security. Unfortunately, it may reveal users’ privacy if they are allowed sharing a photo freely. There must be some mechanism that enables the user to participate in decision- making the activity of user post who can able to view when his\her friends sharing the post. In this work, we propose a set intersection rule and cosine similarity for a privacy preserving manner. Keywords: Trust, OSN, Privacy, Cosine similarity and Set Intersection _______________________________________________________________________________________________________ I. INTRODUCTION A social network the digital level represents of member and their relationships. The concept of social clouds is an emerging illustration that allows users to mutually offer and consume services, such as interest sharing, activity planning, the organization of events, multimedia content exchange, Group chatting and so on. Social clouds offer an appealing way for users to expand and reflect their social relationships and then use them for social interaction or collaboration in business and leisure. Online Social Network is the easiest way to be connected with friends, colleagues as well as establish new contacts with the strangers. OSN enable people to connect with their friends as well as share information about their personal life. OSNs are mainly used for keeping in touch with friends, forming new contacts, as well as search for someone else on the OSN and establish contact with him by sending a friend request. Such contacts are used to share some information with each other as well as broadcast the information through a group. In current online social networks users do not have complete control over who can access their data. While most OSN services provide some privacy settings to limit the audience to which a user’s content published some default setting make this content public. Because most users reveal an astonishing amount of information in their profiles and tend not to change the default privacy. By making some secret / private fields accessible to everyone there are chances of personal information reveal. The personal information privacy oversight leads to the personal information reveal. Leery users take advantage of these profiles to collect other’s private / secret information which leads to personal information manifest which is a threat to the p rivacy of the user. An online social networks has there are some privacy settings for upload the post\image in their timeline. In many realistic scenarios, users need to make access control decisions involving other (possibly stranger) users, e.g., for sharing posts to construct distributed computing platforms. One important trust-enhancing factor, potentially guiding such decisions, is the existence of previously established social relationships. However, the process of discovering mutual friends may harm the privacy of the two parties and that of their friends. At least one party needs to disclose the identity of his friends and, depending on the application scenario, this could reveal the identity of the user, and possibly even information about his lifestyle and social attitudes. Motivated by the above issues, this paper customize of an infrastructure supporting the secure discovery of mutual friends, which we denote as Mutual Friends. It allows two users friends list to decide whether their owners are friends or have mutual friends in a given social network. Similar to exiting survey [13, 14], network similarity between user i and a stranger j is computed based on the use of network information of both i and j. A general way to find this similarity is to count the number of common friends between i and j. However, in this method relationships among common friends of i and j are ignored, losing valuable information. In this paper compute set intersection and cosine similarity to ensure privacy and authentic ity. The mutual friend’s service is interesting in a number of realistic scenarios, where users can make trust and access control decisions in a privacy- preserving manner.