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 secure aggregation with uncoded groupwise keys against user dropouts and user collusion,
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.
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
-
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.
-
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.