Intimacy based Access Control for Social Network Sites

被引:8
作者
Wang, Yonggang [2 ]
Zhai, Ennan [3 ]
Lua, Eng Keong [4 ]
Hu, Jianbin [1 ]
Chen, Zhong
机构
[1] Peking Univ, Key Lab HCST, MoE, Beijing 100871, Peoples R China
[2] Peking Univ, Sch EECS, Beijing 100871, Peoples R China
[3] Yale Univ, Dept Comp Sci, New Haven, CT USA
[4] Monash Univ, Subang Jaya, Selangor, Malaysia
来源
2012 9TH INTERNATIONAL CONFERENCE ON UBIQUITOUS INTELLIGENCE & COMPUTING AND 9TH INTERNATIONAL CONFERENCE ON AUTONOMIC & TRUSTED COMPUTING (UIC/ATC) | 2012年
关键词
social networking sites; social activity; intimacy degree; access control; SYBIL ATTACKS;
D O I
10.1109/UIC-ATC.2012.49
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Participation in social networking sites has dramatically increased in recent years. Users on social networking sites spend lots of time generating large quantities of various personal content items (eg. diaries, albums, and comments) and browsing these varieties of content everyday. However, existing social networking sites do not provide effective access control mechanisms to assure the privacy of user-generated content. A user's personal content on social networking sites may be exposed to other users without any access control. This paper presents iSac, a novel intimacy-based social access control mechanism on social networking sites. iSac allows a user to make his access control policy on social networking sites according to intimacy degrees of him with respect to other users. iSac will first outline a user's activity profile according to his atomic social activities with respect to his seed friends. Then we adopt Naive-Bayes algorithm to calculate the intimacy degrees and rankings of all the user's friends. A content owner can make his access control policy by assigning a range of intimacy degrees. Users whose intimacy degrees are in the acceptable range can visit the content owner's personal content. Our experiments which use data collected from RenRen in China prove that iSac can effectively differentiate a user's friends by intimacy degrees so as to provide a novel access control mechanism with an improved granularity.
引用
收藏
页码:517 / 524
页数:8
相关论文
共 10 条
  • [1] Abdessalem T., 2011, PROC DATABASES SOC N, P31
  • [2] [Anonymous], Philosophical Transactions of the Royal Society of London for, DOI DOI 10.1098/RSTL.1763.0053
  • [3] Carminati B, 2006, LECT NOTES COMPUT SC, V4278, P1734
  • [4] Douceur J.R., 2002, IPTPS
  • [5] Role Based Access Control for Social Network Sites
    Li, Jianguo
    Tang, Yong
    Mao, Chengjie
    Lai, Hanjiang
    Zhu, Jun
    [J]. JCPC: 2009 JOINT CONFERENCE ON PERVASIVE COMPUTING, 2009, : 389 - +
  • [6] TRAN N, 2009, NSDI 09, P15
  • [7] Viswanath B, 2009, 2ND ACM SIGCOMM WORKSHOP ON ONLINE SOCIAL NETWORKS (WOSN 09), P37
  • [8] Wilson C, 2009, EUROSYS'09: PROCEEDINGS OF THE FOURTH EUROSYS CONFERENCE, P205
  • [9] SybilGuard: Defending against sybil attacks via social networks
    Yu, Haifeng
    Kaminsky, Michael
    Gibbons, Phillip B.
    Flaxman, Abraham
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) : 267 - 278
  • [10] SybilLimit: A near-optimal social network defense against sybil attacks
    Yu, Haifeng
    Kaminsky, Michael
    Gibbons, Phillip B.
    Xiao, Feng
    [J]. PROCEEDINGS OF THE 2008 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, 2008, : 3 - +