利用在线社交网络中用户不一致的偏好来发现私人友谊链接

Lei Jin, Hassan Takabi, Xuelian Long, J. Joshi
{"title":"利用在线社交网络中用户不一致的偏好来发现私人友谊链接","authors":"Lei Jin, Hassan Takabi, Xuelian Long, J. Joshi","doi":"10.1145/2665943.2665956","DOIUrl":null,"url":null,"abstract":"In a social network system, a friendship relation between two users is usually represented by an undirected link and it is visible in both users' friend lists. Such a dual visibility of a friendship link may raise privacy threats. This is because both the users of a friendship link can separately control its visibility to other users and their preferences of sharing such a friendship link may not be consistent. Even if one of them conceals the friendship link from a third user, that third user may find the link through the other user's friend list. In addition, as most social network users allow their friends to see their friend lists, an adversary can exploit these inconsistent policies caused by users' conflicting preferences to identify and infer many of a targeted user's friends and even reconstruct the topology of an entire social network. In this paper, we propose, characterize and evaluate such an attack referred as the Friendship Identification and Inference (FII) attack. In an FII attack scenario, an adversary first accumulates the initial attack relevant information based on the friend lists visible to him in a social network. Then, he utilizes this information to identify and infer a target's friends using a random walk based approach. We formally define the attack and present the attack steps, the attack algorithm and various attack schemes. Our experimental results using three real social network datasets show that FII attacks are effective in inferring private friendship links of a target and predicting the topology of the social network. Currently, most popular social network systems, such as Facebook, LinkedIn and Foursquare, are susceptible to FII attacks.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exploiting Users' Inconsistent Preferences in Online Social Networks to Discover Private Friendship Links\",\"authors\":\"Lei Jin, Hassan Takabi, Xuelian Long, J. Joshi\",\"doi\":\"10.1145/2665943.2665956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a social network system, a friendship relation between two users is usually represented by an undirected link and it is visible in both users' friend lists. Such a dual visibility of a friendship link may raise privacy threats. This is because both the users of a friendship link can separately control its visibility to other users and their preferences of sharing such a friendship link may not be consistent. Even if one of them conceals the friendship link from a third user, that third user may find the link through the other user's friend list. In addition, as most social network users allow their friends to see their friend lists, an adversary can exploit these inconsistent policies caused by users' conflicting preferences to identify and infer many of a targeted user's friends and even reconstruct the topology of an entire social network. In this paper, we propose, characterize and evaluate such an attack referred as the Friendship Identification and Inference (FII) attack. In an FII attack scenario, an adversary first accumulates the initial attack relevant information based on the friend lists visible to him in a social network. Then, he utilizes this information to identify and infer a target's friends using a random walk based approach. We formally define the attack and present the attack steps, the attack algorithm and various attack schemes. Our experimental results using three real social network datasets show that FII attacks are effective in inferring private friendship links of a target and predicting the topology of the social network. Currently, most popular social network systems, such as Facebook, LinkedIn and Foursquare, are susceptible to FII attacks.\",\"PeriodicalId\":408627,\"journal\":{\"name\":\"Proceedings of the 13th Workshop on Privacy in the Electronic Society\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 13th Workshop on Privacy in the Electronic Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2665943.2665956\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2665943.2665956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在社交网络系统中,两个用户之间的友谊关系通常由一个无向链接表示,并且在两个用户的好友列表中都是可见的。这种友谊链接的双重可见性可能会带来隐私威胁。这是因为友谊链接的两个用户都可以单独控制其对其他用户的可见性,并且他们分享这种友谊链接的偏好可能不一致。即使其中一个用户对第三个用户隐藏了友情链接,第三个用户也可能通过另一个用户的朋友列表找到这个链接。此外,由于大多数社交网络用户允许他们的朋友看到他们的朋友列表,攻击者可以利用这些不一致的策略来识别和推断目标用户的许多朋友,甚至重建整个社交网络的拓扑结构。在本文中,我们提出,表征和评估这种攻击称为友谊识别和推理(FII)攻击。在FII攻击场景中,攻击者首先根据他在社交网络中看到的朋友列表积累初始攻击相关信息。然后,他利用这些信息,使用基于随机游走的方法来识别和推断目标的朋友。对攻击进行了形式化定义,给出了攻击步骤、攻击算法和各种攻击方案。我们使用三个真实社交网络数据集的实验结果表明,FII攻击在推断目标的私人友谊链接和预测社交网络拓扑结构方面是有效的。目前,大多数流行的社交网络系统,如Facebook、LinkedIn和Foursquare,都容易受到FII攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Exploiting Users' Inconsistent Preferences in Online Social Networks to Discover Private Friendship Links
In a social network system, a friendship relation between two users is usually represented by an undirected link and it is visible in both users' friend lists. Such a dual visibility of a friendship link may raise privacy threats. This is because both the users of a friendship link can separately control its visibility to other users and their preferences of sharing such a friendship link may not be consistent. Even if one of them conceals the friendship link from a third user, that third user may find the link through the other user's friend list. In addition, as most social network users allow their friends to see their friend lists, an adversary can exploit these inconsistent policies caused by users' conflicting preferences to identify and infer many of a targeted user's friends and even reconstruct the topology of an entire social network. In this paper, we propose, characterize and evaluate such an attack referred as the Friendship Identification and Inference (FII) attack. In an FII attack scenario, an adversary first accumulates the initial attack relevant information based on the friend lists visible to him in a social network. Then, he utilizes this information to identify and infer a target's friends using a random walk based approach. We formally define the attack and present the attack steps, the attack algorithm and various attack schemes. Our experimental results using three real social network datasets show that FII attacks are effective in inferring private friendship links of a target and predicting the topology of the social network. Currently, most popular social network systems, such as Facebook, LinkedIn and Foursquare, are susceptible to FII attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信