State-Secrecy Codes for Networked Linear Systems

doi:10.1109/TAC.2019.2927459

2020-05-01

Anastasios Tsiamis *

Konstantinos Gatsis

George J. Pappas

DOI：10.1109/TAC.2019.2927459

原文链接

查看原文

摘要

En 中文

In this paper, we study the problem of remote state estimation, in the presence of a passive eavesdropper. An authorized user estimates the state of an unstable linear plant, based on the packets received from a sensor, while the packets may also be intercepted by the eavesdropper. Our goal is to design a coding scheme at the sensor, which encodes the state information, in order to impair the eavesdropper's estimation performance while enabling the user to successfully decode the sent messages. We introduce a novel class of codes, termed State-Secrecy Codes, which use acknowledgment signals from the user and apply linear time-varying transformations to the current and previously received states. By exploiting the properties of the system's process noise, the channel physical model, and the dynamics, these codes manage to be fast, efficient, and suitable for real-time dynamical systems. We prove that under minimal conditions, State-Secrecy Codes achieve perfect secrecy, namely the eavesdropper's minimum mean square error (mmse) grows unbounded almost surely, whereas the user's estimation performance is optimal. These conditions only require that at least once, the user receives the corresponding packet while the eavesdropper fails to intercept it. Even one occurrence of this event renders the eavesdropper's mmse unbounded with asymptotically optimal rate of increase. State-Secrecy Codes are provided and studied for two cases, first, when direct state measurements are available and second, when we only have output measurements. The theoretical results are illustrated in simulations.

Keyword:

Eavesdropping

Kalman filtering

perfect secrecy

State-Secrecy Codes