首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Fully Anonymous Profile Matching in Mobile Social Networks
【24h】

Fully Anonymous Profile Matching in Mobile Social Networks

机译:移动社交网络中的完全匿名配置文件匹配

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we study user profile matching with privacy-preservation in mobile social networks (MSNs) and introduce a family of novel profile matching protocols. We first propose an explicit Comparison-based Profile Matching protocol (eCPM) which runs between two parties, an initiator and a responder. The eCPM enables the initiator to obtain the comparison-based matching result about a specified attribute in their profiles, while preventing their attribute values from disclosure. We then propose an implicit Comparison-based Profile Matching protocol (iCPM) which allows the initiator to directly obtain some messages instead of the comparison result from the responder. The messages unrelated to user profile can be divided into multiple categories by the responder. The initiator implicitly chooses the interested category which is unknown to the responder. Two messages in each category are prepared by the responder, and only one message can be obtained by the initiator according to the comparison result on a single attribute. We further generalize the iCPM to an implicit Predicate-based Profile Matching protocol (iPPM) which allows complex comparison criteria spanning multiple attributes. The anonymity analysis shows all these protocols achieve the confidentiality of user profiles. In addition, the eCPM reveals the comparison result to the initiator and provides only conditional anonymity; the iCPM and the iPPM do not reveal the result at all and provide full anonymity. We analyze the communication overhead and the anonymity strength of the protocols. We then present an enhanced version of the eCPM, called eCPM+, by combining the eCPM with a novel prediction-based adaptive pseudonym change strategy. The performance of the eCPM and the eCPM+ are comparatively studied through extensive trace-based simulations. Simulation results demonstrate that the eCPM+ achieves significantly higher anonymity strength with slightly larger number of pseudonyms than the eCPM.
机译:在本文中,我们研究了在移动社交网络(MSN)中具有隐私保护的用户配置文件匹配,并介绍了一系列新颖的配置文件匹配协议。我们首先提出一个显式的基于比较的配置文件匹配协议(eCPM),该协议在发起方和响应方两方之间运行。 eCPM使发起者可以获取有关其配置文件中指定属性的基于比较的匹配结果,同时防止其属性值泄露。然后,我们提出了一个隐式的基于比较的配置文件匹配协议(iCPM),该协议允许启动程序直接获取一些消息,而不是来自响应程序的比较结果。响应者可以将与用户配置文件无关的消息分为多个类别。发起者隐式选择响应者未知的感兴趣类别。响应者准备每个类别中的两条消息,发起者根据单个属性上的比较结果只能获得一条消息。我们进一步将iCPM概括为基于隐式谓词的配置文件匹配协议(iPPM),该协议允许跨越多个属性的复杂比较标准。匿名分析显示,所有这些协议都实现了用户配置文件的机密性。此外,eCPM会向发起者显示比较结果,并且仅提供条件匿名; iCPM和iPPM完全不透露结果,并提供完全的匿名性。我们分析了通信开销和协议的匿名强度。然后,我们通过将eCPM与新颖的基于预测的自适应假名更改策略相结合,提出了eCPM的增强版本,称为eCPM +。通过广泛的基于跟踪的模拟,对eCPM和eCPM +的性能进行了比较研究。仿真结果表明,与eCPM相比,eCPM +具有更高的匿名强度,且假名数量略多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号