基于帕特里亚加密的去中心化推荐系统,保护用户隐私且高效。
PADER: Paillier-based Secure Decentralized Social Recommendation
- 用帕特里亚加密改造社交正则化模型,实现安全去中心化训练
- 单用户迭代仅需约1秒,50万条评分训练一周期不到3小时
- 适合注重隐私的推荐场景,如金融、医疗领域
推荐系统普及带来用户与商家数据隐私担忧,因集中式平台过度收集信息。为保障隐私,提出PADER:一种基于帕特里亚加密的去中心化社交推荐系统。用户与商家作为去中心网络节点,推荐模型的训练与推理在无中心平台参与下安全进行。将SoReg(社交正则化)模型视为两方安全多项式计算问题,发现简单二部计算效率低。为此,设计支持任意算术电路的安全加法与乘法协议,并采用适配实数多项式计算的最优数据打包方案。实验表明,处理含数百评分的单个用户仅需约1秒,使用约50万条评分训练一个周期耗时不足3小时,证明方法具备实际应用可行性。代码已开源。
原文摘要 · Abstract (English)
The prevalence of recommendation systems also brings privacy concerns to both the users and the sellers, as centralized platforms collect as much data as possible from them. To keep the data private, we propose PADER: a Paillier-based secure decentralized social recommendation system. In this system, the users and the sellers are nodes in a decentralized network. The training and inference of the recommendation model are carried out securely in a decentralized manner, without the involvement of a centralized platform. To this end, we apply the Paillier cryptosystem to the SoReg (Social Regularization) model, which exploits both user's ratings and social relations. We view the SoReg model as a two-party secure polynomial evaluation problem and observe that the simple bipartite computation may result in poor efficiency. To improve efficiency, we design secure addition and multiplication protocols to support secure computation on any arithmetic circuit, along with an optimal data packing scheme that is suitable for the polynomial computations of real values. Experiment results show that our method only takes about one second to iterate through one user with hundreds of ratings, and training with ~500K ratings for one epoch only takes <3 hours, which shows that the method is practical in real applications. The code is available at https://github.com/GarminQ/PADER.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。