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.
Information-theoretic secure aggregation over regular graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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
-
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.