On a ring of K users with pairwise independent keys, the optimal per-user rate to securely compute the input sum is 1 bit for K=3 or 4 and 2 bits for K>=5.
Private aggregation in hierarchical wireless federated learning with partial and full collusion,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys
On a ring of K users with pairwise independent keys, the optimal per-user rate to securely compute the input sum is 1 bit for K=3 or 4 and 2 bits for K>=5.