TY - JOUR T1 - Information-Theoretic Privacy For Distributed Average Consensus: Bounded Integral Inputs Y1 - 2018 A1 - Nirupam Gupta A1 - Jonathan Katz A1 - Nikhil Chopra AB -
We propose an asynchronous distributed average consensus algorithm that guarantees information-theoretic privacy of honest agents' inputs against colluding passive adversarial agents, as long as the set of colluding passive adversarial agents is not a vertex cut in the underlying communication network. This implies that a network with (t+1)-connectivity guarantees information-theoretic privacy of honest agents' inputs against any t colluding agents. The proposed protocol is formed by composing a distributed privacy mechanism we provide with any (non-private) distributed average consensus algorithm. The agent' inputs are bounded integers, where the bounds are apriori known to all the agents.
UR - https://arxiv.org/abs/1809.01794 ER -