A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion

Dmitry Grishchenko; Filip Hanzely; Jakub Kone\v{c}n\'y; Nicolas Loizou; Peter Richt\'arik

REVIEW

A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1901.09367 v1 pith:U5IBE3G7 submitted 2019-01-27 math.OC cs.DCcs.LGcs.MAcs.SYeess.SY

A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion

Filip Hanzely , Jakub Kone\v{c}n\'y , Nicolas Loizou , Peter Richt\'arik , Dmitry Grishchenko This is my paper

classification math.OC cs.DCcs.LGcs.MAcs.SYeess.SY

keywords algorithmgossiprandomizedaverageboundscomplexityconsensuscontrolled

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

In this work we present a randomized gossip algorithm 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 the method and perform extensive numerical experiments.

A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion

discussion (0)