Privacy-Preserving Convergent Dynamic Average Consensus via State Decomposition

This work develops a distributed algorithm to enable cooperative tracking of the average of time-varying signals while preserving their privacy. We discuss the state decomposition approach, which incorporates public and private versions of estimates at each agent. In the presence of convergent inputs, we show that the existing state decomposition algorithm may not preserve privacy for the convergent input splits that allow convergence, and fail to converge for certain admissible splits. Therefore, we present a novel privacy-preserving algorithm that provides the same order of convergence rates on the estimates as that of the input signals. Further, the algorithm preserves privacy by letting a range of feasible input signals yield the same sequence of public variables. Finally, the algorithm is implemented for maximum likelihood estimation of the mean of data sampled by agents from Gaussians with private and unknown covariances.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/ssp64130.2025.11073227
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Privacy-Preserving Convergent Dynamic Average Consensus via State Decomposition

Lance Kaplan, Parth Paritosh
Privacy-Preserving Technologies in Data
article

Privacy-Preserving Convergent Dynamic Average Consensus via State Decomposition

Lance Kaplan, Parth Paritosh
article en

Abstract

This work develops a distributed algorithm to enable cooperative tracking of the average of time-varying signals while preserving their privacy. We discuss the state decomposition approach, which incorporates public and private versions of estimates at each agent. In the presence of convergent inputs, we show that the existing state decomposition algorithm may not preserve privacy for the convergent input splits that allow convergence, and fail to converge for certain admissible splits. Therefore, we present a novel privacy-preserving algorithm that provides the same order of convergence rates on the estimates as that of the input signals. Further, the algorithm preserves privacy by letting a range of feasible input signals yield the same sequence of public variables. Finally, the algorithm is implemented for maximum likelihood estimation of the mean of data sampled by agents from Gaussians with private and unknown covariances.

DEVCOM Army Research Laboratory (US), United States Army Combat Capabilities Development Command (US)
Army Research Laboratory
Reduced inequalities
Openalex Percentile: Top 90%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.