Scalable and Secure Aggregation in Distributed Networks

Details Scalable and Secure Aggregation in Distributed Networks Scalable and Secure Aggregation in Distributed Networks

2011-07-27

arxiv.org/abs/1107.5419v3

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Scalable and Secure Aggregation in Distributed Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scalable and Secure Aggregation in Distributed Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable and Secure Aggregation in Distributed Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112957