Saved in:
Bibliographic Details
Main Authors: Maithripala, Mihitha, Lin, Zongli
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.05803
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914308239130624
author Maithripala, Mihitha
Lin, Zongli
author_facet Maithripala, Mihitha
Lin, Zongli
contents In multi-agent systems, dynamic average consensus (DAC) is a decentralized estimation strategy in which a set of agents tracks the average of time-varying reference signals. Because DAC requires exchanging state information with neighbors, attackers may gain access to these states and infer private information. In this paper, we develop a privacy-preserving method that protects each agent's reference signal from external eavesdroppers and honest-but-curious agents while achieving the same convergence accuracy and convergence rate as conventional DAC. Our approach masks the reference signals by having each agent draw a random real number for each neighbor, exchanges that number over an encrypted channel at the initialization, and computes a masking value to form a masked reference. Then the agents run the conventional DAC algorithm using the masked references. Convergence and privacy analyses show that the proposed algorithm matches the convergence properties of conventional DAC while preserving the privacy of the reference signals. Numerical simulations validate the effectiveness of the proposed privacy-preserving DAC algorithm.
format Preprint
id arxiv_https___arxiv_org_abs_2602_05803
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Privacy-Preserving Dynamic Average Consensus by Masking Reference Signals
Maithripala, Mihitha
Lin, Zongli
Systems and Control
In multi-agent systems, dynamic average consensus (DAC) is a decentralized estimation strategy in which a set of agents tracks the average of time-varying reference signals. Because DAC requires exchanging state information with neighbors, attackers may gain access to these states and infer private information. In this paper, we develop a privacy-preserving method that protects each agent's reference signal from external eavesdroppers and honest-but-curious agents while achieving the same convergence accuracy and convergence rate as conventional DAC. Our approach masks the reference signals by having each agent draw a random real number for each neighbor, exchanges that number over an encrypted channel at the initialization, and computes a masking value to form a masked reference. Then the agents run the conventional DAC algorithm using the masked references. Convergence and privacy analyses show that the proposed algorithm matches the convergence properties of conventional DAC while preserving the privacy of the reference signals. Numerical simulations validate the effectiveness of the proposed privacy-preserving DAC algorithm.
title Privacy-Preserving Dynamic Average Consensus by Masking Reference Signals
topic Systems and Control
url https://arxiv.org/abs/2602.05803