A Blockchain-Based Decentralized Federated Learning Framework with Committee Consensus
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
Federated learning has been widely studied and applied to various scenarios, such as financial credit, medical identification, and so on. Under these settings, federated learning protects users from exposing their private data, while cooperatively training a shared machine learning algorithm model (i.e., the global model) for a variety of realworld applications. The only data exchanged is the gradient of the model or the updated model (i.e., the local model update). However, the security of federated learning is increasingly being questioned, due to the malicious clients or central servers' constant attack on the global model or user privacy data. To address these security issues, we propose a decentralized federated learning framework based on blockchain, that is, a Block-chain-based Federated Learning framework with Committee consensus (BFLC). Without a centralized server, the framework uses blockchain for the global model storage and the local model update exchange. To enable the proposed BFLC, we also devise an innovative committee consensus mechanism, which can effectively reduce the amount of consensus computing and reduce malicious attacks. We then discuss the scalability of BFLC, including theoretical security, storage optimization, and incentives. Finally, based on a FISCO blockchain system, we perform experiments using an AlexNet model on several frameworks with a real-world dataset FEMNIST. The experimental results demonstrate the effectiveness and security of the BFLC framework.
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.
Integrity signals
Registry
Cites
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.
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?
In the citing paper
“These obstacles could be overcome with swarm learning (SL), in which partners jointly train AI models while avoiding data transfer and monopolistic data governance.”
From Swarm learning for decentralized artificial intelligence in cancer histopathology (2022) · cites this paper as [25]
In the citing paper
“SL, however, offers a solution to the governance problem, providing a true collaborative and democratic approach in which partners communicate and work on the same level, jointly and equally training models and sharing the benefits 25,26,33 .”
From Swarm learning for decentralized artificial intelligence in cancer histopathology (2022) · cites this paper as [25]
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155 · cited 1×
“Each framework performs the classic image classification model AlexNet [14] as the global model and fixed a set of model hyper-parameters to ensure fairness.”
MethodCommunication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215 · cited 3×
“In the original FL settings, FedAvg [12] aggregates all the updates into a new global model.”
BackgroundMethodInfluentialFederated Learning: Strategies for Improving Communication Efficiency
Konečný, J., McMahan, H. B., Yu, F. X., Richtárik, P., Suresh, A. T., & Bacon, D. (2016) · arXiv · doi:10.48550/arxiv.1610.05492 · Cited by 3,766 · cited 3×
“To address the first challenge, the committee consensus mechanism could maximize the generalization ability of the global model by validating the local updates with committee members’ data distribution [1].”
BackgroundMethodInfluentialPrivacy-preserving deep learning
Shokri, R., & Shmatikov, V. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813687 · Cited by 2,356 · cited 1×
“The aggregation can be performed on the local gradients [11] or the local models [12], and the network transmission consumptions of these two methods are equal.”
Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates
Yin, D., Chen, Y., Ramchandran, K., & Bartlett, P. (2018) · arXiv · doi:10.48550/arxiv.1803.01498 · Cited by 1,130 · cited 1×
“In this sub-section, we simulate malicious node attacks to demonstrate how the proposed BFLC, basic FL, and CwMed [15] will be affected under different malicious proportions among active nodes.”
BackgroundLEAF: A Benchmark for Federated Settings
Caldas, S., Duddu, S. M. K., Wu, P., Li, T., Konečný, J., McMahan, H. B., Smith, V., & Talwalkar, A. (2018) · arXiv · doi:10.48550/arxiv.1812.01097 · Cited by 894 · cited 1×
“To demonstrate the effectiveness of the BFLC, we perform it on the real-world federated dataset FEMNIST [13].”
MethodThe Chinese University Of Hong Kong
(2004) · Computer · doi:10.1109/mc.2004.1318822 · Cited by 256
FLChain: A Blockchain for Auditable Federated Learning with Trust and Incentive
Bao, X., Su, C., Xiong, Y., Huang, W., & Hu, Y. (2019) · 2019 5th International Conference on Big Data Computing and Communications (BIGCOM) · doi:10.1109/bigcom.2019.00030 · Cited by 225 · cited 2×
“One of the related works [10] selects a leader to execute the consensus.”
BackgroundGossip Learning as a Decentralized Alternative to Federated Learning
Hegedűs, I., Danner, G., & Jelasity, M. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-22496-7_5 · Cited by 214 · cited 1×
“The study in [5] assumed that the data remains at the edge devices, but it requires no aggregation server or any central component.”
BackgroundWhen Machine Learning Meets Blockchain: A Decentralized, Privacy-preserving and Secure Design
Chen, X., Ji, J., Luo, C., Liao, W., & Li, P. (2018) · 2018 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata.2018.8622598 · Cited by 213 · cited 1×
“[4] propose to leverage the blockchain to record the updates from nodes and the evaluation of those updates.”
Background
Cited by
A survey on federated learning: challenges and applications
Wen, J., Zhang, Z., Lan, Y., Cui, Z., Cai, J., & Zhang, W. (2023) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-022-01647-y · Cited by 883
“Similarly, participants in FL in the financial field will be different financial institutions, which keep investment information of user, and will train different global models for different financial tasks under the assumption that the data are not exposed [136].”
BackgroundFederated Learning: A Survey on Enabling Technologies, Protocols, and Applications
Aledhari, M., Razzak, R., Parizi, R. M., & Saeed, F. (2020) · IEEE Access · doi:10.1109/access.2020.3013541 · Cited by 733
Xu, W., Yang, Z., Ng, D. W. K., Levorato, M., Eldar, Y. C., & Debbah, M. (2023) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2023.3239189 · Cited by 660
“In B5G communication networks, there are new emerging applications such as blockchain techniques [293], [294], [295],”
Heterogeneous Federated Learning: State-of-the-art and Research Challenges
Ye, M., Fang, X., Du, B., Yuen, P. C., & Tao, D. (2024) · ACM Computing Surveys · doi:10.1145/3625558 · Cited by 608
Xu, M., Ng, W. C., Lim, W. Y. B., Kang, J., Xiong, Z., Niyato, D., Yang, Q., Shen, X., & Miao, C. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3221119 · Cited by 564
“To solve this problem, the authors propose a fully decentralized FL framework with committee consensus in [321].”
Metadata
- Authors
- Li, Y., Chen, C., Liu, N., Huang, H., Zheng, Z., & Yan, Q.
- Affiliations
- Sun Yat-sen University (CN)
- WeBank Co. Ltd.
- Venue
- IEEE Network
- Published
- 2021-01
- Volume
- 35
- Issue
- 1
- Pages
- 234-241
- ISSN
- 0890-8044 (ISSN-L)
- 1558-156X
- OpenAlex
- W3014517104
- Cited by
- 645
- References
- 18
- Citations by year
- 2026: 71 · 2025: 132 · 2024: 167 · 2023: 148 · 2022: 82 · 2021: 38
- FWCI
- 27.01
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Network (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Key Research and Development Program (2016YFB1000101)
- National Natural Science Foundation of China (11801595,61722214)
- Natural Science Foundation of Guangdong (2018A030310076,2019A1515011043)
- 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 › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- federated learning, blockchain, decentralized learning, malicious clients, privacy preservation, consensus algorithms, scalability, incentives, AlexNet
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.