Privacy Preserving Randomized Gossip Algorithms

Filip Hanzely, Jakub Konečný, Nicolas Loizou, Peter Richtárik, Dmitry Grishchenko

Research output: Working paper


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.
Original languageEnglish
Publication statusPublished - 23 Jun 2017


  • math.OC


Dive into the research topics of 'Privacy Preserving Randomized Gossip Algorithms'. Together they form a unique fingerprint.

Cite this