Privacy-preserving multi-hop profile-matching protocol for proximity mobile social networks
Privacy-preserving multi-hop profile-matching protocol for proximity mobile social networks
复制标题
DOI：
10.1016/j.future.2016.09.013
复制
发表时间：
2017-03
期刊：
影响因子：
--
通讯作者：
Entao Luo;Qin Liu;J. Abawajy;Guojun Wang
中科院分区：
文献类型：
--
作者：
Entao Luo;Qin Liu;J. Abawajy;Guojun Wang
基于邻近度的移动的社交网络（PMSN）使得用户能够通过用户简档匹配来容易地发现并促进与他人的社交交互。PMSN中的用户配置文件包含敏感的个人信息，偶尔泄漏会侵犯人们的隐私。因此，这是一个重大关切。在本文中，我们提出了一个隐私保护的多跳配置文件匹配协议的PMSNs。该协议允许用户自定义自己的匹配偏好，使匹配结果更加精确。与只关注单跳的最新配置文件匹配方法不同，所提出的方法在几个跳内进行配置文件匹配。安全性和性能分析表明，该协议能以更高的效率实现安全、隐私保护的好友发现。与其他相关协议相比，它的执行时间更短，消耗的能量更少。
Proximity-based mobile social networks (PMSNs) enable users to easily discover and foster social interactions with others through user-profile matching. The user profiles in PMSNs contain sensitive personal information and an occasional leak will violate people’s privacy. Hence, it is a major concern. In this paper, we propose a privacy-preserving multi-hop profile-matching protocol for PMSNs. The proposed protocol allows users to customize their own matching preference and to make the matching results more precise. Unlike the state-of-the-art profile matching approaches that focus only within a single-hop, the proposed approach makes profile matching within several hops. Moreover, analysis of the security and performance indicates that the proposed protocol achieves secure and privacy-preserving friend discovery with higher efficiency. It executes in less time and consumes less energy than other related protocols.