首页> 外文期刊>ACM transactions on information and system security >Efficient Privacy-Preserving Matrix Factorization for Recommendation via Fully Homomorphic Encryption
【24h】

Efficient Privacy-Preserving Matrix Factorization for Recommendation via Fully Homomorphic Encryption

机译:通过全同态加密进行推荐的有效的隐私保护矩阵分解

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

摘要

There are recommendation systems everywhere in our daily life. The collection of personal data of users by a recommender in the system may cause serious privacy issues. In this article, we propose the first privacy-preserving matrix factorization for recommendation using fully homomorphic encryption. Our protocol performs matrix factorization over encrypted users' rating data and returns encrypted outputs so that the recommendation system learns nothing on rating values and resulting user/item profiles. Furthermore, the protocol provides a privacy-preserving method to optimize the tuning parameters that can be a business benefit for the recommendation service providers. To overcome the performance degradation caused by the use of fully homomorphic encryption, we introduce a novel data structure to perform computations over encrypted vectors, which are essential for matrix factorization, through secure two-party computation in part. Our experiments demonstrate the efficiency of our protocol.
机译:我们日常生活中到处都有推荐系统。推荐人在系统中收集用户的个人数据可能会导致严重的隐私问题。在本文中,我们提出了使用完全同态加密进行推荐的首次隐私保护矩阵分解。我们的协议对加密的用户的评分数据执行矩阵分解,并返回加密的输出,因此推荐系统对评分值和最终的用户/项目资料一无所知。此外,该协议提供了一种隐私保护方法来优化调整参数,这对于推荐服务提供商可能是一项商业利益。为了克服由于使用完全同态加密而导致的性能下降,我们引入了一种新颖的数据结构,以通过安全的两方计算部分地对加密矢量执行计算,这对于矩阵因式分解至关重要。我们的实验证明了我们协议的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号