PriMatch: Fairness-aware secure friend discovery protocol in mobile social network
PriMatch: Fairness-aware secure friend discovery protocol in mobile social network
复制标题
PriMatch：移动社交网络中公平感知的安全好友发现协议
DOI：
10.1109/glocom.2012.6503201
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
K. Ota
中科院分区：
文献类型：
--
作者：
M. Li;Zhaoyu Gao;Suguo Du;Haojin Zhu;M. Dong;K. Ota
通过将社交背景信息整合到本地交互中，移动社交网络有望极大地丰富与无处不在的计算环境的交互。然而，在移动社交网络中，移动用户可能面临个人信息和位置隐私泄露的风险。在本研究中，我们首先将安全朋友发现过程建模为一个广义的隐私保护兴趣/档案匹配问题。然后，从现有的安全朋友发现协议中发现了一种新的安全威胁，称为失控攻击，这可能会带来严重的公平性问题。为了应对这种新的威胁，我们引入了一种新的盲向量变换技术，该技术可以隐藏原始向量与变换结果之间的相关性。在此基础上，我们提出了公平感知的隐私保护兴趣/轮廓匹配协议，使得一方可以在不透露其真实兴趣和轮廓的情况下将其兴趣与另一方的轮廓匹配，反之亦然。详细的安全性分析和实际实现证明了该协议的有效性和高效性。
Mobile social networks are expected to substantially enrich interaction with ubiquitous computing environments by integrating social context information into local interactions. However, in mobile social networks, the mobile users may face the risk of leaking their personal information and their location privacy. In this study, we first model the secure friend discovery process as a generalized privacy-preserving interest/profile matching problem. Then, we identify a new security threat arising from existing secure friend discovery protocols, coined as runaway attack, which is expected to introduce serious fairness issue. To address this new threat, we introduce a novel blind vector transformation technique, which could hide the correlation between the original vector and the transformed result. Based on it, we propose our fairness-aware privacy preserving interest/profile matching protocol, which enables one party to match its interest with the profile of another, without revealing its real interest and profile and vice versa. The detailed security analysis as well as real-world implementations demonstrate the effectiveness and the efficiency of the proposed protocol.
使用可信初始化程序进行视觉不经意传输
DOI：
--
发表时间：
2005
期刊：
Proceedings of the Computer Security Symposium 2005 2005巻
影响因子：
--
作者：
T.Omori;K.Hashimoto;M.Yamaguchi;Hidenori Kuwakado
通讯作者：
Hidenori Kuwakado