arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.08846eess.SYcs.CRcs.SY
收藏

最小二乘辨识下加密控制系统的样本辨识复杂度

Sample Identifying Complexity of Encrypted Control Systems Under Least Squares Identification

Kaoru Teranishi, Kiminao Kogiso

摘要:

在以往的研究中,引入了一个样本识别复杂度来捕获对手的系统辨识估计误差。复杂性在定义加密控制系统的安全性以及为系统设计控制器和安全参数方面起着至关重要的作用。本研究提出一种新的样本识别复杂性的加密控制系统下的对手谁识别系统参数使用最小二乘法。所提出的复杂性的特点是由一个可控Gramian和识别输入方差的噪声方差的比率。我们通过数值模拟研究了所提出的复杂性及其与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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑