Cited by 610Privacy-Preserving Technologies in DataBlockchain Technology Applications and SecurityCryptography and Data Security

DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-based Incentive

Weng, Jiasi, Weng, Jian, Zhang, Jilian, Li, Ming, Zhang, Yue, Luo, Weiqi·2019·IEEE Transactions on Dependable and Secure Computing

Abstract

Deep learning can achieve higher accuracy than traditional machine learning algorithms in a variety of machine learning tasks. Recently, privacy-preserving deep learning has drawn tremendous attention from information security community, in which neither training data nor the training model is expected to be exposed. Federated learning is a popular learning mechanism, where multiple parties upload local gradients to a server and the server updates model parameters with the collected gradients. However, there are many security problems neglected in federated learning, for example, the participants may behave incorrectly in gradient collecting or parameter updating, and the server may be malicious as well. In this article, we present a distributed, secure, and fair deep learning framework named DeepChain to solve these problems. DeepChain provides a value-driven incentive mechanism based on Blockchain to force the participants to behave correctly. Meanwhile, DeepChain guarantees data privacy for each participant and provides auditability for the whole training process. We implement a prototype of DeepChain and conduct experiments on a real dataset for different settings, and the results show that our DeepChain is promising.

Integrity signals

Registry

Crossref · 10.1109/tdsc.2019.2952332

Cites

66 of 66 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

This paper’s full text isn’t openly available, 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?

  • Shamir secret sharing and threshold Paillier encryption both consume large computation overhead.

    “References [18, 21] used Shamir secret sharing and threshold Paillier encryption to protect local gradients, respectively, but both consume large computation overhead.”

Cites

Flagged first, then by citations

1 of the 67 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Weng, J., Weng, J., Zhang, J., Li, M., Zhang, Y., & Luo, W.
Affiliations
Jinan University (CN)
Venue
IEEE Transactions on Dependable and Secure Computing
Published
2019
Volume
2018
Pages
1-1
ISSN
  • 1545-5971 (ISSN-L)
  • 1941-0018
  • 2160-9209
OpenAlex
W2889157463
Cited by
610
References
67
Citations by year
2026: 22 · 2025: 60 · 2024: 102 · 2023: 126 · 2022: 112 · 2021: 102 · 2020: 55 · 2019: 27 · 2018: 4
FWCI
33.39
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Dependable and Secure Computing (publishedVersion)
  • IACR Cryptology ePrint Archive (submittedVersion)
Funders
  • National Natural Science Foundation of China (U1736203, 61732021, 61472165, 61373158)
  • Guangdong Provincial Special Funds for Applied Technology Research and Development and Transformation of Important Scientific and Technological Achieve (2016B010124009)
  • National Key RD Program of China (Grant No. 2018YFB1402600)
  • National Key RD Plan of China (2017YFB0802203, 2018YFB1003701)
  • Guangdong Provincial Engineering Technology Research Center on Network Security Detection and Defence (2014B090904067)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
Keywords
privacy-preserving deep learning, federated learning, blockchain, incentive mechanisms, auditability, data privacy, malicious server, participant behavior, distributed deep learning

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