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

Biscotti: A blockchain system for private and secure federated learning

Shayan, Muhammad, Fung, Clement, Yoon, Chris J. M., Beschastnikh, Ivan·2021·IEEE Transactions on Parallel and Distributed Systems

Abstract

Federated Learning is the current state-of-the-art in supporting secure multi-party machine learning (ML): data is maintained on the owner's device and the updates to the model are aggregated through a secure protocol. However, this process assumes a trusted centralized infrastructure for coordination, and clients must trust that the central service does not use the byproducts of client data. In addition to this, a group of malicious clients could also harm the performance of the model by carrying out a poisoning attack. As a response, we propose Biscotti: a fully decentralized peer to peer (P2P) approach to multi-party ML, which uses blockchain and cryptographic primitives to coordinate a privacy-preserving ML process between peering clients. Our evaluation demonstrates that Biscotti is scalable, fault tolerant, and defends against known attacks. For example, Biscotti is able to both protect the privacy of an individual client's update and maintain the performance of the global model at scale when 30 percent adversaries are present in the system.

Integrity signals

Registry

Crossref · 10.1109/tpds.2020.3044223

Cites

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?

  • Blockchain technology can help overcome challenges of ensuring participating devices are trustworthy and not malicious, and fairness and transparency in reward distribution, to manage the federated learning process without intermediaries.

    “Blockchain technology can help overcome these challenges to manage the FL process without the need for intermediaries.”

The citation lists haven’t been fetched yet

References 94 · Cited by 354

Authors
Shayan, M., Fung, C., Yoon, C. J. M., & Beschastnikh, I.
Affiliations
University of British Columbia (CA)
Venue
IEEE Transactions on Parallel and Distributed Systems
Published
2021-07-01
Volume
32
Issue
7
Pages
1513-1525
ISSN
  • 1045-9219 (ISSN-L)
  • 1558-2183
  • 2161-9883
OpenAlex
W3111419317
Cited by
354
References
94
Citations by year
2026: 39 · 2025: 92 · 2024: 101 · 2023: 70 · 2022: 41 · 2021: 11
FWCI
11.98
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Parallel and Distributed Systems (publishedVersion)
Funders
Natural Sciences and Engineering Research Council of Canada (2014-04870)
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
federated learning, blockchain, privacy-preserving machine learning, malicious clients, data poisoning, cryptographic primitives, fault tolerance

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