  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.
