作者
Keith Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone, H Brendan McMahan, Sarvar Patel, Daniel Ramage, Aaron Segal, Karn Seth
发表日期
2017/10/30
图书
proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
页码范围
1175-1191
简介
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 implementation, that its runtime and communication overhead remain low even on large data sets and client pools. For 16-bit input values, our protocol offers $1.73 x communication expansion for 210 users …
引用总数
201720182019202020212022202320241258173372500625826444
学术搜索中的文章
K Bonawitz, V Ivanov, B Kreuter, A Marcedone… - proceedings of the 2017 ACM SIGSAC Conference on …, 2017