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.
Information theoretic secure aggregation with user dropouts
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.IT 3years
2026 3representative citing papers
A hierarchical secure aggregation scheme with arbitrary heterogeneous data assignment achieves optimal two-layer communication loads under information-theoretic security against collusions and dropouts.
For hierarchical secure aggregation with groupwise keys of size G>1, the optimal rate region is fully characterized with user and relay rates at least 1 and minimum groupwise key rate max of two combinatorial terms.
citing papers explorer
-
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.
-
On the Optimality of Hierarchical Secure Aggregation with Arbitrary Heterogeneous Data Assignment
A hierarchical secure aggregation scheme with arbitrary heterogeneous data assignment achieves optimal two-layer communication loads under information-theoretic security against collusions and dropouts.
-
On the Capacity of Hierarchical Secure Aggregation with Groupwise Keys
For hierarchical secure aggregation with groupwise keys of size G>1, the optimal rate region is fully characterized with user and relay rates at least 1 and minimum groupwise key rate max of two combinatorial terms.