CoChat

More Than Privacy: Applying Differential Privacy in Key Areas of Artificial Intelligence

Open access
Zhu, Tianqing, Ye, Dayong, Wang, Wei, Zhou, Wanlei, Yu, Philip S. · 2022 · IEEE Transactions on Knowledge and Data Engineering

The DOI matches its Crossref record; 151 of the 152 references it cites were found in a registry or an index.

Abstract

Artificial Intelligence (AI) has attracted a great deal of attention in recent years. However, alongside all its advancements, problems have also emerged, such as privacy violations, security issues and model fairness. Differential privacy, as a promising mathematical model, has several attractive properties that can help solve these problems, making it quite a valuable tool. For this reason, differential privacy has been broadly applied in AI but to date, no study has documented which differential privacy mechanisms can or have been leveraged to overcome its issues or the properties that make this possible. In this paper, we show that differential privacy can do more than just preserve privacy. It can also be used to improve security, stabilize learning, build fair models, and impose composition in selected areas of AI. With a focus on regular machine learning, distributed machine learning, deep learning, and multi-agent systems, the purpose of this article is to deliver a new view on many possibilities for improving AI performance with differential privacy techniques.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tkde.2020.3014246

Cites

151 of 151 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 151 references

Research works printed but not linked: 12

  1. Russell, 2002, Artificial Intelligence: A Modern Approach
  2. 10.5555/2969033.2969125 · doi:10.5555/2969033.2969125
  3. Chaudhuri, 2011, Differentially private empirical risk minimization, J. Mach. Learn. Res., 12, 1069
  4. Nobel, 2018, Algorithms of Oppression: How Search Engines Reinforce Racism, 10.18574/nyu/9781479833641.001.0001 · DOI · Paper page
  5. Zemel, Learning fair representation, III-325
  6. Dwork, Fairness under composition, 33:1
  7. Zhao, Distributed deep learning under differential privacy with the teacher-student paradigm, 404
  8. 10.1145/3298981 · DOI · Paper page
  9. Bhagoji, Analyzing federated learning through an adversarial lens, 634
  10. 10.1145/2660267.2660348 · DOI · Paper page
  11. Bonanno, 2018, Game Theory
  12. 10.1145/2976734 · DOI

Cited by

Items 101–200 of 219

Metadata

Authors
Zhu, T., Ye, D., Wang, W., Zhou, W., & Yu, P. S.
Affiliations
  • China University of Geosciences (CN)
  • University of Technology Sydney (AU)
  • University of Illinois Chicago (US)
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2022-06-01
Volume
34
Issue
6
Pages
2824-2843
ISSN
  • 1041-4347 (ISSN-L)
  • 1558-2191
  • 2326-3865
OpenAlex
W3047327820
Cited by
219
References
152
Citations by year
2026: 27 · 2025: 64 · 2024: 45 · 2023: 36 · 2022: 23
FWCI
8.08
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Knowledge and Data Engineering (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • OPUS - Open Publications of UTS Scholars (University of Technology Sydney) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • National Natural Science Foundation of China (61972366)
  • National Science Foundation (III-1526499, III-1763325, III-1909323, SaTC-1930941)
  • Australian Research Council Discovery (DP190100981)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Ethics and Social Impacts of AI
  • Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
Keywords
differential privacy, privacy preservation, machine learning security, model fairness, distributed learning, deep learning, multi-agent systems, learning stability, privacy-utility trade-off

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

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.