Compressive Privacy for a Linear Dynamical System

Abstract

We consider a linear dynamical system in which the state vector consists of both public and private states. One or more sensors make measurements of the state vector and sends information to a fusion center, which performs the final state estimation. To achieve an optimal tradeoff between the utility of estimating the public states and protection of the private states, the measurements at each time step are linearly compressed into a lower dimensional space. Under the centralized setting where all measurements are collected by a single sensor, we propose an optimization problem and an algorithm to find the best compression matrix. Under the decentralized setting where measurements are made separately at multiple sensors, each sensor optimizes its own local compression matrix. We propose methods to separate the overall optimization problem into multiple sub-problems that can be solved locally at each sensor. We consider the cases where there is no message exchange between the sensors; and where each sensor takes turns to transmit messages to the other sensors. Simulations and empirical experiments demonstrate the efficiency of our proposed approach in allowing the fusion center to estimate the public states with good accuracy while preventing it from estimating the private states accurately.

References in corpus (9)

• Differential Privacy as a Mutual Information Constraint
• State Estimation over Sensor Networks with Correlated Wireless Fading Channels
• Gossip and Distributed Kalman Filtering: Weak Consensus under Weak Detectability
• Optimal Energy Allocation for Kalman Filtering over Packet Dropping Links with Imperfect Acknowledgments and Energy Harvesting Constraints
• Robust Decentralized Detection and Social Learning in Tandem Networks
• Whose Opinion to follow in Multihypothesis Social Learning? A Large Deviations Perspective
• Distributed Local Linear Parameter Estimation using Gaussian SPAWN
• Ratio Utility and Cost Analysis for Privacy Preserving Subspace Projection
• Hypothesis Testing under Maximal Leakage Privacy Constraints