A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Information Theoretic Secure Aggregation with User Dropouts
[article]
2021
arXiv
pre-print
In the robust secure aggregation problem, a server wishes to learn and only learn the sum of the inputs of a number of users while some users may drop out (i.e., may not respond). The identity of the dropped users is not known a priori and the server needs to securely recover the sum of the remaining surviving users. We consider the following minimal two-round model of secure aggregation. Over the first round, any set of no fewer than U users out of K users respond to the server and the server
arXiv:2101.07750v1
fatcat:2mu4emc6ujbb3awb4kujv4doua