首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing >An information theoretic framework for active de-anonymization in social networks based on group memberships
【24h】

An information theoretic framework for active de-anonymization in social networks based on group memberships

机译:基于组成员资格的社交网络中的主动解之匿名化信息理论框架

获取原文

摘要

In this paper, a new mathematical formulation for the problem of de-anonymizing social network users by actively querying their membership in social network groups is introduced. In this formulation, the attacker has access to a noisy observation of the group membership of each user in the social network. When an unidentified victim visits a malicious website, the attacker uses browser history sniffing to make queries regarding the victim's social media activity. Particularly, it can make polar queries regarding the victim's group memberships and the victim's identity. The attacker receives noisy responses to her queries. The goal is to de-anonymize the victim with the minimum number of queries. Starting with a rigorous mathematical model for this active de-anonymization problem, an upper bound on the attacker's expected query cost is derived, and new attack algorithms are proposed which achieve this bound. These algorithms vary in computational cost and performance. The results suggest that prior heuristic approaches to this problem provide sub-optimal solutions.
机译:在本文中,介绍了通过积极查询社交网络组的成员资格,介绍了一种新的数学制定。在这种制定中,攻击者可以访问社交网络中每个用户的组成员的嘈杂观察。当未认定的受害者访问恶意网站时,攻击者使用浏览器历史嗅探,以便对受害者的社交媒体活动进行查询。特别是,它可以对受害者的团体成员和受害者的身份进行极地查询。攻击者对她的疑问收到嘈杂的回应。目标是将受害者与最低次数进行匿名。从一个严格的数学模型开始为此有源去匿名化问题,导出了攻击者的预期查询成本的上限,并提出了实现这一界限的新攻击算法。这些算法以计算成本和性能而异。结果表明,此问题的先前启发式方法提供了次优的解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号