The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Privacy-Preserving Byzantine-Robust Federated Learning via Blockchain Systems
Open accessAbstract
Federated learning enables clients to train a machine learning model jointly without sharing their local data. However, due to the centrality of federated learning framework and the untrustworthiness of clients, traditional federated learning solutions are vulnerable to poisoning attacks from malicious clients and servers. In this paper, we aim to mitigate the impact of the central server and malicious clients by designing a Privacy-preserving Byzantine-robust Federated Learning (PBFL) scheme based on blockchain. Specifically, we use cosine similarity to judge the malicious gradients uploaded by malicious clients. Then, we adopt fully homomorphic encryption to provide secure aggregation. Finally, we use blockchain system to facilitate transparent processes and implementation of regulations. Our formal analysis proves that our scheme achieves convergence and provides privacy protection. Our extensive experiments on different datasets demonstrate that our scheme is robust and efficient. Even if the root dataset is small, our scheme can achieve the same efficiency as FedSGD.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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
“The use of secure robust aggregation is currently recognized as an effective means for defending against Byzantine attacks (Li et al. 2023d;Miao et al. 2022;Wan et al. 2022).”
From Survey: federated learning data security and privacy-preserving in edge-Internet of Things (2024) · cites this paper as Miao et al. 2022
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Communication-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
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542
Deep Learning: Methods and Applications
Deng, L., & Yu, D. (2014) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000039 · Cited by 3,480
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Large Scale Distributed Deep Networks
Dean, J. B., Corrado, G. S., Monga, R., Chen, K., Devin, M., Mao, M., Ranzato, M., Senior, A., Tucker, P. A., Yang, K., et al. (2012) · Cited by 3,202
Homomorphic Encryption for Arithmetic of Approximate Numbers
Cheon, J. H., Kim, A., Kim, M., & Song, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70694-8_15 · Cited by 2,522
Federated Learning With Differential Privacy: Algorithms and Performance Analysis
Wei, K., Li, J., Ding, M., Ma, C., Yang, H. H., Farokhi, F., Jin, S., Quek, T. Q. S., & Vincent Poor, H. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2988575 · Cited by 2,400
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,341
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption
Phong, L. T., Aono, Y., Hayashi, T., Wang, L., & Moriai, S. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2787987 · Cited by 1,662
Gentry, C., Sahai, A., & Waters, B. R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,571
How to backdoor federated learning
Bagdasaryan, E., Veit, A., Hua, Y., Estrin, D., & Shmatikov, V. (2018) · arXiv · doi:10.48550/arxiv.1807.00459 · Cited by 1,495
(2017) · neural information processing systems · Cited by 1,413
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
A Hybrid Approach to Privacy-Preserving Federated Learning
Truex, S., Baracaldo, N., Anwar, A., Steinke, T., Ludwig, H., Zhang, R., & Zhou, Y. (2019) · Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security · doi:10.1145/3338501.3357370 · Cited by 1,029
FLTrust: Byzantine-robust Federated Learning via Trust Bootstrapping
Cao, X., Fang, M., Liu, J., & Gong, N. Z. (2021) · Proceedings 2021 Network and Distributed System Security Symposium · doi:10.14722/ndss.2021.24434 · Cited by 999
Data Poisoning Attacks Against Federated Learning Systems
Tolpegin, V., Truex, S., Gursoy, M. E., & Liu, L. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58951-6_24 · Cited by 927
Blockchained On-Device Federated Learning
Kim, H., Park, J., Bennis, M., & Kim, S.-L. (2020) · IEEE Communications Letters · doi:10.1109/lcomm.2019.2921755 · Cited by 887
Local Model Poisoning Attacks to Byzantine-Robust Federated Learning
Fang, M., Cao, X., Jia, J., & Gong, N. Z. (2019) · arXiv · doi:10.48550/arxiv.1911.11815 · Cited by 828
Analyzing Federated Learning through an Adversarial Lens
Bhagoji, A. N., Chakraborty, S., Mittal, P., & Calo, S. (2018) · arXiv · doi:10.48550/arxiv.1811.12470 · Cited by 703
The Hidden Vulnerability of Distributed Learning in Byzantium
Mhamdi, E. M. E., Guerraoui, R., & Rouault, S. (2018) · arXiv · doi:10.48550/arxiv.1802.07927 · Cited by 648
A Blockchain-Based Decentralized Federated Learning Framework with Committee Consensus
Li, Y., Chen, C., Liu, N., Huang, H., Zheng, Z., & Yan, Q. (2021) · IEEE Network · doi:10.1109/mnet.011.2000263 · Cited by 645
More Effective Distributed ML via a Stale Synchronous Parallel Parameter Server
Ho, Q., Cipar, J., Cui, H., Kim, J. K., Lee, S., Gibbons, P. B., Gibson, G. A., Ganger, G. R., & Xing, E. P. (2013) · PubMed · doi:10.1184/r1/6475898 · Cited by 586
BatchCrypt: Efficient Homomorphic Encryption for Cross-Silo Federated Learning
Zhang, C., Li, S., XIA, J., Wang, W., Yan, F., & Liu, Y. (2020) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 522
Gazelle: A Low Latency Framework for Secure Neural Network InferencePreprint
Juvekar, C., Vaikuntanathan, V., & Chandrakasan, A. P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.05507 · Cited by 503
DBA: Distributed Backdoor Attacks against Federated Learning
Xie, C., Huang, K., Chen, P., & Li, B. (2020) · International Conference on Learning Representations · Cited by 472
Mitigating Sybils in Federated Learning Poisoning
Fung, C., Yoon, C. J. M., & Beschastnikh, I. (2018) · arXiv · doi:10.48550/arxiv.1808.04866 · Cited by 385
CrypTFlow2: Practical 2-Party Secure Inference
Rathee, D., Rathee, M., Kumar, N., Chandran, N., Gupta, D., Rastogi, A., & Sharma, R. (2020) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3372297.3417274 · Cited by 354
Privacy-Enhanced Federated Learning Against Poisoning Adversaries
Liu, X., Li, H., Xu, G., Chen, Z., Huang, X., & Lu, R. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3108434 · Cited by 351
Self-citationSecure Outsourced Matrix Computation and Application to Neural Networks
Jiang, X., Kim, M., Lauter, K., & Song, Y. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243837 · Cited by 334
On or Off the Blockchain? Insights on Off-Chaining Computation and Data
Eberhardt, J., & Tai, S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67262-5_1 · Cited by 229
BAFFLE : Blockchain Based Aggregator Free Federated Learning
Ramanan, P., & Nakayama, K. (2020) · IEEE International Conference on Blockchain (Blockchain) · doi:10.1109/blockchain50366.2020.00017 · Cited by 193
Numerical Method for Comparison on Homomorphically Encrypted Numbers
Cheon, J. H., Kim, D., Kim, D., Lee, H. H., & Lee, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34621-8_15 · Cited by 133
Privacy-Preserving Tensor Decomposition Over Encrypted Data in a Federated Cloud Environment
Feng, J., Yang, L. T., Zhu, Q., & Choo, K. R. (2018) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2018.2881452 · Cited by 123
Self-citationOff-chaining Models and Approaches to Off-chain Computations
Eberhardt, J., & Heiss, J. (2018) · doi:10.1145/3284764.3284766 · Cited by 85
Privacy Preserving High-Order Bi-Lanczos in Cloud–Fog Computing for Industrial Applications
Feng, J., Yang, L. T., Zhang, R., Qiang, W., & Chen, J. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.2998086 · Cited by 65
A Secured Privacy-Preserving Multi-Level Blockchain Framework for Cluster Based VANET
Akhter, A. F. M. S., Ahmed, M., Shah, A. F. M. S., Anwar, A., & Zengi̇n, A. (2021) · Sustainability · doi:10.3390/su13010400 · Cited by 65
FLOD: Oblivious Defender for Private Byzantine-Robust Federated Learning with Dishonest-Majority.Preprint
Dong, Y., Chen, X., Li, K., Wang, D., & Zeng, S. (2021) · IACR Cryptology ePrint Archive · Cited by 18
Research works printed but not linked: 1
- 10.1109/MNET.011.2000263 · DOI · Paper page
Cited by
Sorted by citations
Myrzashova, R., Alsamhi, S. H., Shvetsov, A. V., Hawbani, A., & Wei, X. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3263598 · Cited by 178
“Traditional FL methods mainly rely on the server’s involvement, which could lead to a single point of failure and malicious server activity [68].”
Privacy-Preserving and Traceable Federated Learning for data sharing in industrial IoT applications
Chen, J., Xue, J., Wang, Y., Huang, L., Baker, T., & Zhou, Z. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119036 · Cited by 109
Survey: federated learning data security and privacy-preserving in edge-Internet of Things
Li, H., Ge, L., & Tian, L. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10774-7 · Cited by 112
“The use of secure robust aggregation is currently recognized as an effective means for defending against Byzantine attacks (Li et al. 2023d; Miao et al. 2022; Wan et al. 2022).”
Self-citationEfficient Verifiable Protocol for Privacy-Preserving Aggregation in Federated Learning
Eltaras, T., Sabry, F., Labda, W., Alzoubi, K., & AHMEDELTARAS, Q. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3273914 · Cited by 100
“Blockchain technology can be used to secure federated learning and introduce device and model trust as demonstrated in [39] and [40].”
Tariq, A., Serhani, M. A., Sallabi, F., Barka, E. S., Qayyum, T., Khater, H. M., & Shuaib, K. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3438264 · Cited by 130
Metadata
- Authors
- Miao, Y., Liu, Z., Li, H., Choo, K.-K. R., & Deng, R. H.
- Affiliations
- Xidian University (CN)
- University of Electronic Science and Technology of China (CN)
- The University of Texas at San Antonio (US)
- Singapore Management University (SG)
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2022
- Volume
- 17
- Pages
- 2848-2861
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W4289656845
- Semantic Scholar
- 0070997f3305097cce932a073a09e2bed9c8d406
- Cited by
- 303
- References
- 41
- Citations by year
- 2026: 57 · 2025: 101 · 2024: 97 · 2023: 44 · 2022: 4
- FWCI
- 20.23
- Type
- journal article
- Language
- en
- Open access
- Licence
- Locations
- IEEE Transactions on Information Forensics and Security (publishedVersion)
- Singapore Management University Institutional Knowledge (InK) (Singapore Management University) (submittedVersion, other-oa)
- Funders
- National Natural Science Foundation of China (62072361, 62125205)
- Key Research and Development Program of Shaanxi (2022GY-019)
- Fundamental Research Funds for the Central Universities (JB211505)
- Henan Key Laboratory of Network Cryptography Technology and the State Key Laboratory of Mathematical Engineering and Advanced Computing (LNCT2020-A06)
- Cloud Technology Endowed Professorship
- 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, privacy preservation, Byzantine robustness, blockchain, poisoning attacks, malicious clients, malicious server, cosine similarity, fully homomorphic encryption, secure aggregation, convergence analysis
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
