LGCCDCITMay 2, 2024

Privacy-aware Berrut Approximated Coded Computing for Federated Learning

arXiv:2405.01704v32 citationsh-index: 6J Netw Comput Appl
Originality Incremental advance
AI Analysis

This addresses privacy concerns for data owners in Federated Learning, though it appears incremental as it builds on existing coded computing techniques.

The paper tackles privacy vulnerabilities in Federated Learning by proposing a solution based on Berrut Approximated Coded Computing adapted to Secret Sharing, which enables input privacy for non-linear functions and distributed matrix multiplication while maintaining a good trade-off between privacy and precision.

Federated Learning (FL) is an interesting strategy that enables the collaborative training of an AI model among different data owners without revealing their private datasets. Even so, FL has some privacy vulnerabilities that have been tried to be overcome by applying some techniques like Differential Privacy (DP), Homomorphic Encryption (HE), or Secure Multi-Party Computation (SMPC). However, these techniques have some important drawbacks that might narrow their range of application: problems to work with non-linear functions and to operate large matrix multiplications and high communication and computational costs to manage semi-honest nodes. In this context, we propose a solution to guarantee privacy in FL schemes that simultaneously solves the previously mentioned problems. Our proposal is based on the Berrut Approximated Coded Computing, a technique from the Coded Distributed Computing paradigm, adapted to a Secret Sharing configuration, to provide input privacy to FL in a scalable way. It can be applied for computing non-linear functions and treats the special case of distributed matrix multiplication, a key primitive at the core of many automated learning tasks. Because of these characteristics, it could be applied in a wide range of FL scenarios, since it is independent of the machine learning models or aggregation algorithms used in the FL scheme. We provide analysis of the achieved privacy and complexity of our solution and, due to the extensive numerical results performed, a good trade-off between privacy and precision can be observed.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes