Secure and Privacy Preserving Consensus for Second-order Systems Based on Paillier Encryption
It addresses the gap between first-order and higher-order dynamics in privacy-preserving consensus for networked control systems, but the extension is incremental.
This paper extends secure and privacy-preserving consensus to second-order systems using Paillier encryption with random weights, providing theoretical conditions for privacy and consensus rate, verified numerically.
This paper aims at secure and privacy preserving consensus algorithms of networked systems. Due to the technical challenges behind decentralized design of such algorithms, the existing results are mainly restricted to a network of systems with simplest first-order dynamics. Like many other control problems, breakthrough of the gap between first-order dynamics and higher-order ones demands for more advanced technical developments. In this paper, we explore a Paillier encryption based average consensus algorithm for a network of systems with second-order dynamics, with randomness added to network weights. The conditions for privacy preserving, especially depending on consensus rate, are thoroughly studied with theoretical analysis and numerical verification.