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.
On the capacity region of individual key rates in vector linear secure aggregation
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.IT 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
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.
The paper derives tight information-theoretic bounds on communication and key rates for secure multi-server aggregation under heterogeneous security constraints and arbitrary collusion, with matching schemes in most regimes and a bounded-gap scheme in the rest.
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.
-
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.
-
Multi-Server Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints
The paper derives tight information-theoretic bounds on communication and key rates for secure multi-server aggregation under heterogeneous security constraints and arbitrary collusion, with matching schemes in most regimes and a bounded-gap scheme in the rest.