Event-triggered privacy-preserving bipartite consensus for multi-agent systems based on encryption

26Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, the privacy-preserving-based bipartite consensus control problem is investigated for a class of discrete-time nonlinear multi-agent systems (MASs). The classical bipartite consensus control implementation relies on the explicit information exchange between agents, which will lead to the possible leakage of agents’ private information, especially the initial states. Therefore, to prevent data disclosure to neighbors inside the MASs and the outside eavesdroppers, the data is encrypted by means of Paillier encryption scheme during information transmission. This means each agent first sends the relative data in the form of ciphertext to its neighbors for further encryption process, and then restores the control protocol based on the returned encrypted information from the neighbors. Since homomorphic encryption only works for integers, the data must be quantized before encryption, and it will inevitably result in the quantization error. On the other hand, for the purpose of saving communication resources, both decentralized and distributed event-triggered schemes are also proposed. Resorting to the Lyapunov stability theory and algebraic graph theory, sufficient conditions are derived ensuring that the MASs subject to a confidential communication agreement can achieve the bounded bipartite consensus. Two numerical examples are presented to verify the validity of the theoretical results.

Cite

CITATION STYLE

APA

Yang, Z., Yu, L., Liu, Y., Alotaibi, N. D., & Alsaadi, F. E. (2022). Event-triggered privacy-preserving bipartite consensus for multi-agent systems based on encryption. Neurocomputing, 503, 162–172. https://doi.org/10.1016/j.neucom.2022.06.074

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free