论文标题
有效的隐私机器学习的有效辍学的聚合
Efficient Dropout-resilient Aggregation for Privacy-preserving Machine Learning
论文作者
论文摘要
随着数据渴望机器学习算法的越来越多,个人数据隐私已成为可能阻碍数字转换成功的关键问题之一。因此,保护隐私的机器学习(PPML)受到了学术界和行业的广泛关注。但是,组织面临着一个困境,一方面,鼓励他们共享数据以提高ML绩效,但另一方面,他们可能会违反相关的数据隐私法规。实用的PPML通常允许多个参与者单独训练其ML模型,然后将其汇总以以隐私保护方式构建全球模型,例如,基于多方计算或同型加密。然而,在大规模ppml的最重要应用中,例如,通过汇总客户的梯度以更新联合学习的全球模型,例如移动应用服务的消费者行为建模,一些参与者不可避免地是由于其移动性而导致的PPML系统可能会掉出来。因此,保护隐私聚合的弹性已成为要解决的重要问题。在本文中,我们提出了一个可扩展的隐私聚合方案,该方案可以随时忍受参与者的辍学,并通过设置适当的系统参数来确保与半honest和Active恶意对手的安全。通过用种子同型伪随机生成器代替通信密集型构建块,并依靠Shamir Secret共享计划的加法同型同型属性,我们的计划在运行时超过了6.37美元的$ 6.37 $ \ timples $ \ timples $ \ timple $ \ timples $ \ timples $ \ timples $ \ timple and untime $ \ timple and timples and tim $ \ timple''我们计划的简单性使其对实施和进一步的改进具有吸引力。
With the increasing adoption of data-hungry machine learning algorithms, personal data privacy has emerged as one of the key concerns that could hinder the success of digital transformation. As such, Privacy-Preserving Machine Learning (PPML) has received much attention from both academia and industry. However, organizations are faced with the dilemma that, on the one hand, they are encouraged to share data to enhance ML performance, but on the other hand, they could potentially be breaching the relevant data privacy regulations. Practical PPML typically allows multiple participants to individually train their ML models, which are then aggregated to construct a global model in a privacy-preserving manner, e.g., based on multi-party computation or homomorphic encryption. Nevertheless, in most important applications of large-scale PPML, e.g., by aggregating clients' gradients to update a global model for federated learning, such as consumer behavior modeling of mobile application services, some participants are inevitably resource-constrained mobile devices, which may drop out of the PPML system due to their mobility nature. Therefore, the resilience of privacy-preserving aggregation has become an important problem to be tackled. In this paper, we propose a scalable privacy-preserving aggregation scheme that can tolerate dropout by participants at any time, and is secure against both semi-honest and active malicious adversaries by setting proper system parameters. By replacing communication-intensive building blocks with a seed homomorphic pseudo-random generator, and relying on the additive homomorphic property of Shamir secret sharing scheme, our scheme outperforms state-of-the-art schemes by up to 6.37$\times$ in runtime and provides a stronger dropout-resilience. The simplicity of our scheme makes it attractive both for implementation and for further improvements.