Private relationships in social networks

被引:21
作者
Carminati, Barbara [1 ]
Ferrari, Elena [1 ]
Perego, Andrea [1 ]
机构
[1] Univ Studi Insubria, DICOM, Varese, Italy
来源
2007 IEEE 23RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOP, VOLS 1-2 | 2007年
关键词
D O I
10.1109/ICDEW.2007.4400987
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Current social networks implement very simple protection mechanisms, according to which a user can state 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/her resources and personal information. With this aim, in [21 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 enforce a selective dissemination of information concerning relationships across a social network.
引用
收藏
页码:163 / 171
页数:9
相关论文
共 7 条
[1]  
BARNES SB, 2006, FIRST MONDAY SEP, V11
[2]  
Carminati B, 2006, LECT NOTES COMPUT SC, V4278, P1734
[3]  
DING L, 2005, P 38 ANN HAW INT C S
[4]  
GOLBECK JA, 2005, THESIS GRADUATE SCH
[5]  
Huang ZQ, 2006, IEEE INT C NETW SENS, P997
[6]   Social networks applied [J].
Staab, S .
IEEE INTELLIGENT SYSTEMS, 2005, 20 (01) :80-80
[7]  
WEITZNER DJ, 2006, WEB INFORM SECURITY, P1, DOI DOI 10.4018/978-1-59140-588-7.CH001