In this paper we develop a simple, yet effective, secure communication protocol based on linear algebra that allows messages to be transmitted securely, without the need to encrypt them through computationally demanding approaches or to consider integer-valued plain messages, except during an initialization phase. The scheme is composed by several layers of protection and is applied to a scenario involving a networked Kalman filter fed by measurements sent by a sensor through a public network. Specifically, the two actors interact at initialization by exchanging suitably encrypted matrices; then, each message is split in two parts and is altered via a linear non-invertible transformation. Notably, each message is guaranteed to correspond to an unobservable measurement, while the receiver is provided with a strategy to reconstruct the message through simple calculations based on the information exchanged during the initialization phase. To further mask the messages, Gaussian noise with statistics known to both parties is artificially added to the messages. A simulation campaign completes the paper and demonstrates its effectiveness experimentally.
Fioravanti, C., Oliva, G., Panzieri, S., Hadjicostis, C.N. (2022). A Secure Communication Protocol with Application to Networked Kalman Filtering. In Proceedings of the American Control Conference (pp.2361-2366). Institute of Electrical and Electronics Engineers Inc. [10.23919/ACC53348.2022.9867333].
A Secure Communication Protocol with Application to Networked Kalman Filtering
Panzieri S.
;
2022-01-01
Abstract
In this paper we develop a simple, yet effective, secure communication protocol based on linear algebra that allows messages to be transmitted securely, without the need to encrypt them through computationally demanding approaches or to consider integer-valued plain messages, except during an initialization phase. The scheme is composed by several layers of protection and is applied to a scenario involving a networked Kalman filter fed by measurements sent by a sensor through a public network. Specifically, the two actors interact at initialization by exchanging suitably encrypted matrices; then, each message is split in two parts and is altered via a linear non-invertible transformation. Notably, each message is guaranteed to correspond to an unobservable measurement, while the receiver is provided with a strategy to reconstruct the message through simple calculations based on the information exchanged during the initialization phase. To further mask the messages, Gaussian noise with statistics known to both parties is artificially added to the messages. A simulation campaign completes the paper and demonstrates its effectiveness experimentally.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.