Practical Secure Aggregation for Privacy-Preserving Machine Learning
Google (United States) · Cornell University
Abstract
We design a novel, communication-efficient, failure-robust protocol for secure aggregation of high-dimensional data. Our protocol allows a server to compute the sum of large, user-held data vectors from mobile devices in a secure manner (i.e. without learning each user's individual contribution), and can be used, for example, in a federated learning setting, to aggregate user-provided model updates for a deep neural network. We prove the security of our protocol in the honest-but-curious and active adversary settings, and show that security is maintained even if an arbitrarily chosen subset of users drop out at any time. We evaluate the efficiency of our protocol and show, by complexity analysis and a concrete…
Citation impact
- FWCI
- 115.50
- Percentile
- 100%
- References
- 56
Authors
9Topics & keywords
- Computer science
- Overhead (engineering)
- Protocol (science)
- Universal composability
- Adversary
- Computer network
- Aggregate (composite)
- Cryptographic protocol