000208765 001__ 208765
000208765 005__ 20190317000202.0
000208765 037__ $$aREP_WORK
000208765 245__ $$aScalable and Secure Aggregation in Distributed Networks
000208765 269__ $$a2011
000208765 260__ $$bCoRR$$c2011
000208765 336__ $$aWorking Papers
000208765 520__ $$aWe 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.
000208765 700__ $$aGambs, Sebastien
000208765 700__ $$0240335$$g105326$$aGuerraoui, Rachid
000208765 700__ $$0246646$$g196561$$aHarkous, Hamza
000208765 700__ $$0245135$$g209315$$aHuc, Florian
000208765 700__ $$aKermarrec, Anne-Marie
000208765 8564_ $$uhttps://infoscience.epfl.ch/record/208765/files/scal_secur_aggreg_dn1107.5419v3.pdf$$zPreprint$$s377201$$yPreprint
000208765 909C0 $$xU10407$$0252114$$pDCL
000208765 909CO $$ooai:infoscience.tind.io:208765$$qGLOBAL_SET$$pworking$$pIC
000208765 917Z8 $$x166927
000208765 937__ $$aEPFL-WORKING-208765
000208765 973__ $$aEPFL
000208765 980__ $$aWORKING