Social Networks Research Aspects: A Vast and Fast Survey Focused on the Issue of Privacy in Social Network Sites <s> 17-1-4 Protecting Against SNS Providers <s> In this paper we introduce a novel scheme for key management in social networks that is a first step towards the creation of a private social network. A social network graph (i.e., the graph of friendship relationships) is private and social networks are often used to share content, which may be private, amongst its users. In the status quo, the social networking server has access to both this graph and to all of the content, effectively requiring that it is a trusted third party. The goal of this paper is to produce a mechanism through which users can control how their content is shared with other users, without relying on a trusted third party to manage the social network graph and the users' data. The specific access control model considered here is that users will specify access policies based on distance in the social network; for example some content is visible to friends only, while other content is visible to friends of friends, etc. This access control is enforced via key management. That is for each user, there is a key that only friends should be able to derive, there is a key that both friends of the user and friends of friends can derive, etc. The proposed scheme enjoys the following properties: i) the scheme is asynchronous in that it does not require users to be online at the same time, ii) the scheme provides key indistinguishability (that is if a user is not allowed to derive a key according to the access policy, then that key is indistinguishable from a random value), iii) the scheme is efficient in terms of server storage and key derivation time, and iv) the scheme is collusion resistant. <s> BIB001 </s> Social Networks Research Aspects: A Vast and Fast Survey Focused on the Issue of Privacy in Social Network Sites <s> 17-1-4 Protecting Against SNS Providers <s> Now a days, more and more of social network data are being published in one way or other. So, preserving privacy in publishing social network data has become an important concern. With some local knowledge about individuals in a social network, an adversary may attack the privacy of some victims easily. Most of the work done so far towards privacy preservation can deal with relational data only. However, Bin Zhou and Jian Pei [11] proposed a scheme for anonymization of social networks, which is an initiative in this direction and provides a partial solution to this problem. In fact, their algorithm cannot handle the situations in which an adversary has knowledge about vertices in the second or higher hops of a vertex, in addition to its immediate neighbors. In this paper, we propose a modification to their algorithm for the network anonymization which can handle such situations. In doing so, we use an algorithm for graph isomorphism based on adjacency matrix instead of their approach using DFS technique [11]. More importantly, the time complexity of our algorithm is less than that of Zhou and Pei. <s> BIB002
Another privacy related concern is about inappropriate or undesired use of users' information by SNS providers [67] BIB002 [63]. Towards solving this problem a key management scheme is presented in BIB001 . In the proposed method, information is encrypted and SNS providers are unaware of the keys. It is claimed that it does not have a weakness of some other related works and does not require the user and her information viewer to be present at the same time. In  a client-server based arichitecture is proposed for protecting users' information from SNS providers' access in which information is transferred as encrypted blocks. In [67] peer to peer (P2P) architecture for SNSs and researchers tendency for designing this architecture for next generation of SNSs is mentioned. Some of the advantages of client-server architecture over P2P architecture (like more efficient data mining in a central repository), and shortcomings of using client-server architecture with encryption (like some relations of users being detectable by other data like IP addresses) are also noted. A combination of P2P architecture and a good encryption scheme is noted as a better solution for privacy protection in SNSs.