SYSYMar 28, 2019

Finite Time Encryption Schedule in the Presence of an Eavesdropper with Operation Cost

arXiv:1903.117639 citationsh-index: 56
AI Analysis

This work addresses privacy in cyber-physical systems by providing a theoretically grounded encryption schedule for remote state estimation, though it is an incremental extension of existing optimal scheduling frameworks.

The paper proposes a finite-time encryption scheduling strategy for remote state estimation against eavesdroppers, minimizing a weighted sum of estimation errors at the legitimate receiver and the eavesdropper while accounting for encryption cost. The optimal policy is proven to be deterministic and Markovian with a threshold structure.

In this paper, we consider a remote state estimation problem in the presence of an eavesdropper. A smart sensor takes measurement of a discrete linear time-invariant (LTI) process and sends its local state estimate through a wireless network to a remote estimator. An eavesdropper can overhear the sensor transmissions with a certain probability. To enhance the system privacy level, we propose a novel encryption strategy to minimize a linear combination of the expected error covariance at the remote estimator and the negative of the expected error covariance at the eavesdropper, taking into account the cost of the encryption process. We prove the existence of an optimal deterministic and Markovian policy for such an encryption strategy over a finite time horizon. Two situations, namely, with or without knowledge of the eavesdropper estimation error covariance are studied and the optimal schedule is shown to satisfy the threshold-like structure in both cases. Numerical examples are given to illustrate the results.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes