Scalable and Secure Aggregation in Distributed Networks - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Scalable and Secure Aggregation in Distributed Networks

(1, 2) , (3, 4) , (3) , (3) , (5)
1
2
3
4
5

Abstract

We consider the problem of computing an aggregation function in a \emph{secure} and \emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of $O(n^3)$, we present a distributed protocol that requires only a communication complexity of $O(n\log^3 n)$, which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates $(1/2-\epsilon)n$ malicious nodes for any constant $1/2 > \epsilon > 0$ (not depending on $n$), and outputs the exact value of the aggregated function with high probability.

Dates and versions

hal-00660056 , version 1 (15-01-2012)

Identifiers

Cite

Sebastien Gambs, Rachid Guerraoui, Hamza Harkous, Florian Huc, Anne-Marie Kermarrec. Scalable and Secure Aggregation in Distributed Networks. 2011. ⟨hal-00660056⟩
658 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More