Cited by 96Privacy-Preserving Technologies in DataAdversarial Robustness in Machine LearningCryptography and Data Security

Trusted AI in Multiagent Systems: An Overview of Privacy and Security for Distributed Learning

Open access
Ma, Chuan, Li, Jun, Wei, Kang, Liu, Bo, Ding, Ming, Yuan, Long, Han, Zhu, Vincent Poor, H.·2023·Proceedings of the IEEE

Abstract

Motivated by the advancing computational capacity of distributed end-user equipment (UE), as well as the increasing concerns about sharing private data, there has been considerable recent interest in machine learning (ML) and artificial intelligence (AI) that can be processed on distributed UEs. Specifically, in this paradigm, parts of an ML process are outsourced to multiple distributed UEs. Then, the processed information is aggregated on a certain level at a central server, which turns a centralized ML process into a distributed one and brings about significant benefits. However, this new distributed ML paradigm raises new risks in terms of privacy and security issues. In this article, we provide a survey of the emerging security and privacy risks of distributed ML from a unique perspective of information exchange levels, which are defined according to the key steps of an ML process, i.e., we consider the following levels: 1) the level of preprocessed data; 2) the level of learning models; 3) the level of extracted knowledge; and 4) the level of intermediate results. We explore and analyze the potential of threats for each information exchange level based on an overview of current state-of-the-art attack mechanisms and then discuss the possible defense methods against such threats. Finally, we complete the survey by providing an outlook on the challenges and possible directions for future research in this critical area.

Integrity signals

Registry

Crossref · 10.1109/jproc.2023.3306773

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Black-box models may still make poor predictions even in the absence of adversarial attacks due to significant biases and prejudices in the training set.

    “Leading to significant biases and prejudices in the training set, black-box models may still make poor predictions even in the absence of adversarial attacks [28], [46], [47].”
  • The ultimate level of transparency is retained by simulable models, next by decomposable structures, and subsequently by computationally transparent configurations.

    “The ultimate level of transparency is retained by simulable models, next by decomposable structures, and subsequently by computationally transparent configurations [46], [50].”
  • To assess the significance of an input characteristic, there are two work pathways: feature importance and activation maximization.

    “To assess the significance of an input characteristic, there are two different work pathways which include feature importance and activation maximization [46], [53].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Ma, C., Li, J., Wei, K., Liu, B., Ding, M., Yuan, L., Han, Z., & Vincent Poor, H.
Affiliations
  • Zhejiang Lab (CN)
  • Nanjing University of Science and Technology (CN)
  • Hong Kong Polytechnic University (HK)
  • University of Technology Sydney (AU)
  • Data61 (AU)
  • Kyung Hee University (KR)
  • Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA
Venue
Proceedings of the IEEE
Published
2023-09
Volume
111
Issue
9
Pages
1097-1132
ISSN
  • 0018-9219 (ISSN-L)
  • 1558-2256
OpenAlex
W4386737174
Cited by
96
References
26
Citations by year
2026: 24 · 2025: 32 · 2024: 30 · 2023: 9 · 2022: 1
FWCI
8.41
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the IEEE (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Key Research and Development Program of China (2022YFF0712100)
  • National Natural Science Foundation of China (62002170, 61902184)
  • Fundamental Research Funds for the Central Universities (30921013104)
  • Science and Technology on Information Systems Engineering Laboratory (WDZC20205250411)
  • Future Network Grant of Provincial Education Board in Jiangsu
  • Youth Foundation Project of Zhejiang Laboratory (K2023PD0AA01)
  • Research Initiation Project of Zhejiang Laboratory
  • U.S. National Science Foundation, U.S. Department of Transportation, Toyota and Amazon (CNS-2107216, CNS-2128368, CNS-2128448, CMMI-2222810, ECCS-2302469, ECCS-2335876)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
Keywords
trustworthy AI, multi-agent systems, distributed learning, privacy, security (computing), privacy attacks, defense mechanisms, data privacy, model privacy, intermediate outcomes, edge computing

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review