论文标题
在Oracle-ADED MPC框架内保存隐私的加权联合学习
Privacy-preserving Weighted Federated Learning within Oracle-Aided MPC Framework
论文作者
论文摘要
本文研究了在Oracle辅助多方计算(MPC)框架内保护隐私的加权联合学习。本文的贡献主要包括以下三个: 在第一个方面,我们称之为加权联合学习(WFL)的新概念是由McMahan等人的开创性论文引入和正式化的。本文正式形式上的加权联合学习概念与McMahan等人的论文中提出的概念不同,因为加法和乘法操作都是通过我们的模型中的密码执行的,而这些操作是通过McMahan等人的模型中的宣传来执行的。 在第二倍中,通过将联合学习系统的安全性与基础多方计算的安全性解耦,用于计算加权联合学习的MPC解决方案是形式化的。我们的去耦公式可以使机器学习开发人员从最新的安全工具集中选择最佳安全实践; 在第三范围内,提出和分析了加权联邦学习问题的具体解决方案。假设潜在的乘法算法是安全的,可以保证我们实施的安全性。
This paper studies privacy-preserving weighted federated learning within the oracle-aided multi-party computation (MPC) framework. The contribution of this paper mainly comprises the following three-fold: In the first fold, a new notion which we call weighted federated learning (wFL) is introduced and formalized inspired by McMahan et al.'s seminal paper. The weighted federated learning concept formalized in this paper differs from that presented in McMahan et al.'s paper since both addition and multiplication operations are executed over ciphers in our model while these operations are executed over plaintexts in McMahan et al.'s model. In the second fold, an oracle-aided MPC solution for computing weighted federated learning is formalized by decoupling the security of federated learning systems from that of underlying multi-party computations. Our decoupling formulation may benefit machine learning developers to select their best security practices from the state-of-the-art security tool sets; In the third fold, a concrete solution to the weighted federated learning problem is presented and analysed. The security of our implementation is guaranteed by the security composition theorem assuming that the underlying multiplication algorithm is secure against honest-but-curious adversaries.