pith. sign in

arxiv: 1808.08085 · v3 · pith:VLJQ7JJNnew · submitted 2018-08-24 · 📡 eess.SY · cs.SY· math.OC

A dynamical approach to privacy preserving average consensus

classification 📡 eess.SY cs.SYmath.OC
keywords systemaverageconsensusmaskedprivacyattractorcannotglobal
0
0 comments X
read the original abstract

In this paper we propose a novel method for achieving average consensus in a continuous-time multiagent network while avoiding to disclose the initial states of the individual agents. In order to achieve privacy protection of the state variables, we introduce maps, called output masks, which alter the value of the states before transmitting them. These output masks are local (i.e., implemented independently by each agent), deterministic, time-varying and converging asymptotically to the true state. The resulting masked system is also time-varying and has the original (unmasked) system as its limit system. It is shown in the paper that the masked system has the original average consensus value as a global attractor. However, in order to preserve privacy, it cannot share an equilibrium point with the unmasked system, meaning that in the masked system the global attractor cannot be also stable.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.