skip to main content
research-article

Privacy-preserving Resilient Consensus for Multi-agent Systems in a General Topology Structure

Published:26 June 2023Publication History
Skip Abstract Section

Abstract

Recent advances of consensus control have made it significant in multi-agent systems such as in distributed machine learning, distributed multi-vehicle cooperative systems. However, during its application it is crucial to achieve resilience and privacy; specifically, when there are adversary/faulty nodes in a general topology structure, normal agents can also reach consensus while keeping their actual states unobserved.

In this article, we modify the state-of-the-art Q-consensus algorithm by introducing predefined noise or well-designed cryptography to guarantee the privacy of each agent state. In the former case, we add specified noise on agent state before it is transmitted to the neighbors and then gradually decrease the value of noise so the exact agent state cannot be evaluated. In the latter one, the Paillier cryptosystem is applied for reconstructing reward function in two consecutive interactions between each pair of neighboring agents. Therefore, multi-agent privacy-preserving resilient consensus (MAPPRC) can be achieved in a general topology structure. Moreover, in the modified version, we reconstruct reward function and credibility function so both convergence rate and stability of the system are improved.

The simulation results indicate the algorithms’ tolerance for constant and/or persistent faulty agents as well as their protection of privacy. Compared with the previous studies that consider both resilience and privacy-preserving requirements, the proposed algorithms in this article greatly relax the topological conditions. At the end of the article, to verify the effectiveness of the proposed algorithms, we conduct two sets of experiments, i.e., a smart-car hardware platform consisting of four vehicles and a distributed machine learning platform containing 10 workers and a server.

REFERENCES

  1. [1] Baras J. S. and Liu X.. 2019. Trust is the cure to distributed consensus with adversaries. In Proceedings of the 27th Mediterranean Conference on Control and Automation (MED). 195202.Google ScholarGoogle ScholarCross RefCross Ref
  2. [2] Deng L.. 2012. The MNIST database of handwritten digit images for machine learning research. IEEE Sig. Process. Mag. 29, 6 (2012), 141142.Google ScholarGoogle ScholarCross RefCross Ref
  3. [3] Dibaji S. M. and Ishii H.. 2017. Resilient consensus of second-order agent networks: Asynchronous update rules over robust graphs. Automatica 81 (2017), 123132.Google ScholarGoogle ScholarCross RefCross Ref
  4. [4] Du H., Zhu W., Wen G., Duan Z., and Lv J.. 2017. Distributed formation control of multiple quadrotor aircraft based on nonsmooth consensus algorithms. IEEE Trans. Cyber. 49, 1 (2017), 342353.Google ScholarGoogle ScholarCross RefCross Ref
  5. [5] Fang W., Zamani M., and Chen Z.. 2021. Secure and privacy preserving consensus for second-order systems based on paillier encryption. Syst. Contr. Lett. 148 (2021), 104869.Google ScholarGoogle ScholarCross RefCross Ref
  6. [6] Fiore D. and Russo G.. 2019. Resilient and private consensus in multi-agent systems. In Proceedings of the European Control Conference. IEEE, 34783483.Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] Fiore D. and Russo G.. 2019. Resilient consensus for multi-agent systems subject to differential privacy requirements. Automatica 106 (2019), 1826.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Hadjicostis C. N. and Domínguez-García. A. D.2020. Privacy-preserving distributed averaging via homomorphically encrypted ratio consensus. IEEE Trans. Automat. Cont. 65, 9 (2020), 38873894.Google ScholarGoogle ScholarCross RefCross Ref
  9. [9] Haseltalab A. and Akar M.. 2015. Approximate byzantine consensus in faulty asynchronous networks. In Proceedings of the American Control Conference. IEEE, 15911596.Google ScholarGoogle ScholarCross RefCross Ref
  10. [10] Haseltalab A. and Akar M.. 2015. Convergence rate analysis of a fault-tolerant distributed consensus algorithm. In Proceedings of the Conference on Decision and Control. IEEE, 51115116.Google ScholarGoogle ScholarCross RefCross Ref
  11. [11] He J., Cai L., Cheng P., Pan J., and Shi L.. 2019. Consensus-based data-privacy preserving data aggregation. IEEE Trans. Automat. Contr. 64, 12 (2019), 52225229.Google ScholarGoogle ScholarCross RefCross Ref
  12. [12] He J., Cai L., Zhao C., Cheng P., and Guan X.. 2019. Privacy-preserving average consensus: Privacy analysis and algorithm design. IEEE Trans. Sig. Inf. Process. Netw. 5, 1 (2019), 127138.Google ScholarGoogle ScholarCross RefCross Ref
  13. [13] Hou J., Wang F., Wang L., and Chen Z.. 2021. Reinforcement learning based multi-agent resilient control: From deep neural networks to an adaptive law. In Proceedings of the AAAI Conference on Artificial Intelligence. IEEE, 77377745.Google ScholarGoogle ScholarCross RefCross Ref
  14. [14] Ishii H. and Suzuki A.. 2018. Distributed randomized algorithms for PageRank computation: Recent advances. Uncertainty in complex networked systems. In Honor of Roberto Tempo (2018), 419447.Google ScholarGoogle Scholar
  15. [15] Katewa V., Pasqualetti F., and Gupta V.. 2018. On privacy vs. cooperation in multi-agent systems. Int. J. Contr. 91, 7 (2018), 16931707.Google ScholarGoogle ScholarCross RefCross Ref
  16. [16] Lazzeretti R., Horn S., Braca P., and Willett P.. 2014. Secure multi-party consensus gossip algorithms. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 74067410.Google ScholarGoogle ScholarCross RefCross Ref
  17. [17] LeBlanc H. J. and Koutsoukos X. D.. 2011. Consensus in networked multi-agent systems with adversaries. In Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control. 281290.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. [18] LeBlanc H. J. and Koutsoukos X. D.. 2012. Low complexity resilient consensus in networked multi-agent systems with adversaries. In Proceedings of the 15th ACM International Conference on Hybrid Systems: Computation and Control. 514.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. [19] LeCun Y., Bottou L., Bengio Y., and Haffner P.. 1998. Gradient-based learning applied to document recognition. Proc. IEEE 86, 11 (1998), 22782324.Google ScholarGoogle ScholarCross RefCross Ref
  20. [20] Li Nianyu, Tsigkanos Christos, Jin Zhi, Dustdar Schahram, Hu Zhenjiang, and Ghezzi Carlo. 2019. POET: Privacy on the edge with bidirectional data transformations. In Proceedings of the IEEE International Conference on Pervasive Computing and Communications. IEEE, 110.Google ScholarGoogle ScholarCross RefCross Ref
  21. [21] Li N., Zhang M., Kang E., and Garlan D.. 2021. Engineering secure self-adaptive systems with Bayesian games. Fundam. Approach. Softw. Eng. 12649 (2021), 130151.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. [22] Lian X., Huang Y., Li Y., and Liu J.. 2015. Asynchronous parallel stochastic gradient for nonconvex optimization. In Advances in Neural Information Processing Systems 28. IEEE, Montreal, Quebec, Canada, 27372745.Google ScholarGoogle Scholar
  23. [23] Mahsa E. T.. 2017. A game-theoretic decision-making framework for engineering self-protecting software systems. In Proceedings of the IEEE/ACM International Conference on Software Engineering Companion. IEEE, 449452.Google ScholarGoogle Scholar
  24. [24] Manitara N. E. and Hadjicostis C. N.. 2013. Privacy-preserving asymptotic average consensus. In Proceedings of the European Control Conference. IEEE, 760765.Google ScholarGoogle ScholarCross RefCross Ref
  25. [25] Mikulski D. G., Lewis F. L., Gu E. Y., and Hudas G. R.. 2012. Trust method for multi-agent consensus. In Proceedings of the Conference on Unmanned Systems Technology. 115.Google ScholarGoogle ScholarCross RefCross Ref
  26. [26] Mo Y. and Murray R. M.. 2016. Privacy preserving average consensus. IEEE Trans. Automat. Control 62, 2 (2016), 753765.Google ScholarGoogle ScholarCross RefCross Ref
  27. [27] Nguyen Dinh C., Ding Ming, Pathirana Pubudu N., Seneviratne Aruna, and Zomaya Albert Y.. 2022. Federated learning for COVID-19 detection with generative adversarial networks in edge cloud computing. IEEE Internet Things J. 9, 12 (2022), 1025710271.Google ScholarGoogle ScholarCross RefCross Ref
  28. [28] Ning B., Han Q., and Zuo Z.. 2017. Distributed optimization for multiagent systems: An edge-based fixed-time consensus approach. IEEE Trans. Cyber. 49, 1 (2017), 122132.Google ScholarGoogle ScholarCross RefCross Ref
  29. [29] Pan X., Zhang M., Wu D., Xiao Q., Ji S., and Yang Z.. 2020. Justinian’s GAAvernor: Robust distributed learning with gradient aggregation agent. In Proceedings of the USENIX Security Symposium. IEEE, 16411658.Google ScholarGoogle Scholar
  30. [30] Ramos G., Silvestre D., and Silvestre C.. 2022. General resilient consensus algorithms. Internat. J. Control 95, 6 (2022), 14821496.Google ScholarGoogle ScholarCross RefCross Ref
  31. [31] Ruan M., Ahmad M., and Wang Y.. 2017. Secure and privacy-preserving average consensus. In Proceedings of the Workshop on Security and Privacy in Cyber-Physical Systems. IEEE, 123129.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. [32] Ruan M., Gao H., and Wang Y.. 2019. Secure and privacy-preserving consensus. IEEE Trans. Automat. Control 64, 10 (2019), 40354049.Google ScholarGoogle ScholarCross RefCross Ref
  33. [33] Saulnier K., Saldana D., Prorok A., Pappas G. J., and Kumar V.. 2017. Resilient flocking for mobile robot teams. IEEE Robot. Automat. Lett. 2, 2 (2017), 10391046.Google ScholarGoogle ScholarCross RefCross Ref
  34. [34] Senejohnny D. M., Sundaram S., Persis C. De, and Tesi P.. 2019. Resilience against misbehaving nodes in asynchronous networks. Automatica 104 (2019), 2633.Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. [35] Sundaram S. and Hadjicostis C. N.. 2011. Distributed function calculation via linear iterative strategies in the presence of malicious agents. IEEE Trans. Automat. Contr. 56, 7 (2011), 14951508.Google ScholarGoogle ScholarCross RefCross Ref
  36. [36] Yang Z. and Bajwa W. U.. 2019. ByRDiE: Byzantine-resilient distributed coordinate descent for decentralized learning. IEEE Trans. Sig. Inf. Process. Netw. 5, 4 (2019), 611627.Google ScholarGoogle ScholarCross RefCross Ref
  37. [37] Zhang H. and Sundaram S.. 2012. Robustness of information diffusion algorithms to locally bounded adversaries. In Proceedings of the American Control Conference. 58555861.Google ScholarGoogle Scholar
  38. [38] Zhang J., Tan J., and Wang J.. 2021. Privacy security in control systems. Sci. China Inf. Sci. 64 (2021), 176201.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Privacy-preserving Resilient Consensus for Multi-agent Systems in a General Topology Structure

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Privacy and Security
      ACM Transactions on Privacy and Security  Volume 26, Issue 3
      August 2023
      640 pages
      ISSN:2471-2566
      EISSN:2471-2574
      DOI:10.1145/3582895
      Issue’s Table of Contents

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 26 June 2023
      • Online AM: 16 March 2023
      • Accepted: 16 February 2023
      • Revised: 26 October 2022
      • Received: 13 December 2021
      Published in tops Volume 26, Issue 3

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
    • Article Metrics

      • Downloads (Last 12 months)286
      • Downloads (Last 6 weeks)36

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    View Full Text