As a side-effect-free method, meter coding can successfully detect stealthy false data injection (FDI) attacks without significantly affecting physical plants by encoding the sensor outputs with an invertible matrix. ...
详细信息
As a side-effect-free method, meter coding can successfully detect stealthy false data injection (FDI) attacks without significantly affecting physical plants by encoding the sensor outputs with an invertible matrix. However, since the relationship between the detection of stealthy FDI attacks and the cost of meter coding was not clearly analyzed in existing works, the optimal design of codingschemes has not been well studied. This paper investigates the optimal design of codingschemes based on the analysis of detection conditions for stealthy FDI attacks in power system state estimation. Specifically, detection conditions for stealthy FDI attacks are derived in both general and special codingschemes, which reveal the requirements on the encoded measurements, the coding scheme and the meters in power systems. Utilizing the constraints determined by the detection conditions, the optimization of the special coding scheme is formulated and equivalently simplified, which decouples the design of coding matrix with the other decision variables. Finally, simulation results are carried out on the alternating current (AC) state estimation in the IEEE 14-bus and 57-bus test systems to validate theoretical results on the conditions and cost of detecting stealthy FDI attacks in meter coding.
The rth relative generalised Hamming weight (RGHW) of an [n, k] linear code C and an [n, k(1)] subcode C-1, a generalisation of generalised Hamming weight (GHW), characterises code performances of wiretap channel of t...
详细信息
The rth relative generalised Hamming weight (RGHW) of an [n, k] linear code C and an [n, k(1)] subcode C-1, a generalisation of generalised Hamming weight (GHW), characterises code performances of wiretap channel of type II, secure network coding, linear ramp secret sharing scheme, trellis complexity etc. In this study, the authors investigate non-asymptotic and asymptotic bounds on RGHW. In the non-asymptotic setting, they present a new proof of the Griesmer bound on RGHW by residue code and introduce the new concept of relative chain condition. They show that code pairs meeting the Griesmer, Singleton, and weak Plotkin bounds satisfy this condition. The notion of relative chain condition and these results provide a new perspective on researches including evaluating trellis complexity and determining the weight hierarchy of code pairs etc. In the asymptotic setting, they improve previous work by introducing two new metrics, respectively, for the cases r is fixed and r is proportionally increasing with n. They show the asymptotic Singleton, Plotkin, and Gilbert-Varshamov bounds on the first metric and determine the value of the second metric, which is helpful for characterising the optimal asymptotic performances of applications and constructing the optimal coding schemes.
暂无评论