Privacy preserving randomized gossip algorithms

Abstract
In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for all methods, and perform extensive numerical experiments.

Publisher
arXiv

arXiv
1706.07636

Additional Links
http://arxiv.org/abs/1706.07636v1http://arxiv.org/pdf/1706.07636v1

Permanent link to this record