Privacy-Preserving Profile Matching Protocol Considering Conditions
Privacy-Preserving Profile Matching Protocol Considering Conditions
复制标题
DOI：
10.1007/978-3-319-46298-1_12
复制
发表时间：
2016-09
期刊：
影响因子：
--
通讯作者：
Yosuke Ishikuro;Kazumasa Omote
中科院分区：
文献类型：
--
作者：
Yosuke Ishikuro;Kazumasa Omote
一种社交配对服务最近变得流行起来。这些服务帮助用户搜索具有共同偏好或兴趣的朋友。另一方面，用户使用他们的个人信息进行匹配的社会匹配服务，因此，隐私保护的配置文件匹配协议已经得到了很好的研究。然而，尽管存在各种隐私保护简档匹配协议，但它们可能导致不情愿的匹配。为了解决这一问题，需要实现一种考虑条件的细粒度匹配机制，本文提出了一种嵌入同态加密的考虑条件的隐私保护轮廓匹配协议：仅当满足条件时才建立匹配。我们的协议通过使用映射到素数技术和设置诚实但好奇的服务器来降低用户设备的计算成本。此外，即使服务器受到攻击，用户的秘密密钥或个人数据不会泄漏，因为我们的协议是为没有此类机密数据的服务器而设计的。
A social matching service has recently become popular. These services help a user to search friends having common preference or interest. On the other hand, users use their personal information for matching in social matching services, and thus the privacy-preserving profile matching protocols have been well studied. However, although there are various privacy-preserving profile matching protocols, they may cause unwilling matching. In order to solve this problem, it is necessary to achieve a fine-grained matching mechanism considering conditions.In this paper, we propose a privacy-preserving profile matching protocol embedded with homomorphic encryption considering conditions: matching is established only when the conditions are satisfied. Our protocol reduces computational cost of user’s device by using the map-to-prime technique and setting an honest-but-curious server. Furthermore, even if a server is attacked, user’s secret key or personal data does not leak since our protocol is designed for a server without such confidential data.