The capacity region among randomness for security, key-distribution communication, and aggregation communication is completely characterized for T-colluding secure aggregation with N users under a general two-phase user-to-user key distribution framework.
Communication- Computation Efficient Secure Aggregation for Federated Learning
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2representative citing papers
For decentralized secure aggregation with at least U surviving users and at most T colluders, the optimal two-round rates are R1 ≥ 1 and R2 ≥ 1/(U-T-1) when U > T+1, and the task is impossible otherwise.
citing papers explorer
-
The Capacity of Information-Theoretic Secure Aggregation in Federated Learning
The capacity region among randomness for security, key-distribution communication, and aggregation communication is completely characterized for T-colluding secure aggregation with N users under a general two-phase user-to-user key distribution framework.
-
Information-Theoretic Decentralized Secure Aggregation with User Dropouts
For decentralized secure aggregation with at least U surviving users and at most T colluders, the optimal two-round rates are R1 ≥ 1 and R2 ≥ 1/(U-T-1) when U > T+1, and the task is impossible otherwise.