I study two privacy-preserving social network graphs to dis- close the types of relationships of connecting edges and provide flexible multigrained access control. To create such graphs, my schemes employ the concept of secretaries and types of relationships. It is significantly more efficient than those that using expensive cryptographic primitives. I also show how these schemes can be used for multigrained access control with various options. In addition, I describe how much these schemes are resilient to infer the types of connecting edges.
Carminati @cite_8 described an access control model where authorized users determined based on the relationships are only granted to access to another user's social network. They stored the encrypted relationship information with relationship keys using public key cryptography.
@cite_8
2095966401
Current social networks implement very simple protection mechanisms, according to which a user can slate whether his her personal data, relationships, and resources should be either public or accessible only by him herself (or, at most, by users with whom he she has a direct relationship). This is not enough, in that there is the need of more flexible mechanisms, making a user able to decide which network participants are authorized to access his lier resources and personal information. With this aim, we have proposed an access control model where authorized users are denoted based on the relationships they participate in. Nonetheless, we believe that this is just a first step towards a more comprehensive privacy framework for social networks. Indeed, besides users' resources and personal data, also users' relationships may convey sensitive information. For this reason, in this paper we focus on relationship protection, by proposing a strategy exploiting cryptographic techniques to enfotce a selective dissemination of information concerning relationships across a social network.