Zero-Knowledge Proof-Based Approach for Verifying the Computational Integrity of Power Grid Controls: arXiv:2211.06724 [math.OC]

The control of future power grids will migrate from centralized to distributed/decentralized scheme to enable a massive penetration of distributed energy resources (DERs) and bring extreme enhancements of autonomous operations in terms of resiliency, security, and reliability. Most focus has been on the design of distributed/ decentralized controllers. However, the guarantees of the proper execution of the controls are also essential but relatively less emphasized. A common assumption is that local controllers would fully follow the designated control dynamics. Such assumption could be risky because the proper control executions are then built on trust rather than regulation, and a full success of preventing cyberattack. On the other hand, it is impractical for an actuator (verifier) to repeat all the computations involved in the controls to verify the computational integrity. In this work, we leverage a type of cryptography technology, known as zk-STARKs (Zero- Knowledge Scalable Transparent ARguments of Knowledge), so that the verifier can check the computational integrity with much less computations. Our focus will be on projected linear dynamics that are commonly seen in distributed/decentralized power system controllers. In particular, we derive polynomial conditions in the context of zk-STARKs for the projected linear dynamics. A proof-of-concept numerical study is also included.