论文标题
在最小二乘识别下识别加密控制系统的复杂性的样本
Sample Identifying Complexity of Encrypted Control Systems Under Least Squares Identification
论文作者
论文摘要
在先前的研究中引入了样本识别复杂性，以捕获对手的系统识别估计误差。复杂性在定义加密控制系统的安全性并为系统设计控制器和安全参数方面起着至关重要的作用。这项研究提出了一个新的样本，识别在对手下使用最小二乘方法识别系统参数的对手的复杂性。所提出的复杂性的特征是可控性格拉米亚语和识别输入方差与噪声方差的比率。我们通过数值模拟研究了提出的复杂性及其与Gramian和方差比率相关的变化的紧密性。仿真结果表明，提出的复杂性以足够的水平捕获了估计误差的行为。此外，它证实，随着方差比的增加，Gramian可控性的效果变得更大。
A sample identifying complexity has been introduced in the previous study to capture an adversary's estimation error of system identification. The complexity plays a crucial role in defining the security of encrypted control systems and designing a controller and security parameter for the systems. This study proposes a novel sample identifying complexity of encrypted control systems under an adversary who identifies system parameters using a least squares method. The proposed complexity is characterized by a controllability Gramian and ratio of identification input variance to the noise variance. We examine the tightness of the proposed complexity and its changes associated with the Gramian and variance ratio through numerical simulations. The simulation results demonstrate that the proposed complexity captures a behavior of estimation error with a sufficient level. Moreover, it confirmed that the effect of controllability Gramian in the proposed complexity becomes larger as the variance ratio increases.
