State Estimation with Protecting Exogenous Inputs via Cram\'er-Rao Lower Bound Approach
read the original abstract
This paper addresses the real-time state estimation problem for dynamic systems while protecting exogenous inputs against adversaries, who may be honest-but-curious third parties or external eavesdroppers. The Cram\'er-Rao lower bound (CRLB) is employed to constrain the mean square error (MSE) of the adversary's estimate for the exogenous inputs above a specified threshold. By minimizing the MSE of the state estimate while ensuring a certain privacy level measured by CRLB, the problem is formulated as a constrained optimization. To solve the optimization problem, an explicit expression for CRLB is first provided. As the computational complexity of the CRLB increases with the time step, a low-complexity approach is proposed to make the complexity independent of time. Then, a relaxation approach is proposed to efficiently solve the optimization problem. Finally, a privacy-preserving state estimation algorithm with low complexity is developed, which also ensures $(\epsilon, \delta)$-differential privacy. Two illustrative examples, including a practical scenario for protecting building occupancy, demonstrate the effectiveness of the proposed algorithm.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Secure Parameter Identification for Multi-Participant ARX Systems via CKKS Cryptosystem-Based Proxy Re-Encryption
A CKKS-based proxy re-encryption scheme with truncated discrete Gaussian noise enables secure multi-participant ARX parameter identification while proving IND-CPA security and mean-square convergence.
-
Differentially Private Gradient-Tracking-Based Distributed Stochastic Optimization over Directed Graphs
A differentially private gradient-tracking algorithm for distributed stochastic optimization on directed graphs uses subsampling schemes to achieve convergence for nonconvex objectives with finite privacy budget.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.