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(n3), we
present a distributed protocol that requires only a communication complexity of
O(nlog3n), which we prove is near-optimal. Our protocol ensures perfect
security against a computationally-bounded adversary, tolerates
(1/2âÏ”)n malicious nodes for any constant 1/2>Ï”>0 (not
depending on n), and outputs the exact value of the aggregated function with
high probability