Student or educator? Sign up with your school email and get 6 months of Pro free.

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

Practical and Robust Federated Learning With Highly Scalable Regression Training

Open access
Han, Song, Ding, Hongxin, Zhao, Shuai, Ren, Siqi, Wang, Zhibo, Lin, Jianhong, Zhou, Shuhao·2024·IEEE Transactions on Neural Networks and Learning Systems

Abstract

Privacy-preserving federated learning, as one of the privacy-preserving computation techniques, is a promising distributed and privacy-preserving machine learning (ML) approach for Internet of Medical Things (IoMT), due to its ability to train a regression model without collecting raw data of data owners (DOs). However, traditional interactive federated regression training (IFRT) schemes rely on multiple rounds of communication to train a global model and are still under various privacy and security threats. To overcome these problems, several noninteractive federated regression training (NFRT) schemes have been proposed and applied in a variety of scenarios. However, there are still several challenges: 1) how to protect the privacy of DOs' local dataset; 2) how to realize highly scalable regression training without linear dependence on sample dimension; 3) how to tolerate DOs' dropout; and 4) how to enable DOs to verify the correctness of aggregated results returned from the cloud service provider (CSP). In this article, we propose two practical noninteractive federated learning schemes with privacy-preserving for IoMT, named homomorphic encryption based NFRT (HE-NFRT) and double-masking protocol based NFRT (Mask-NFRT), respectively, which are based on a comprehensive consideration of NFRT, privacy concerns, high-efficiency, robustness, and verification mechanism. The security analyses display that our proposed schemes are able to protect the privacy of DOs' local training data, resist collusion attack, and support strong verification to each DO. The performance evaluation results demonstrate that our proposed HE-NFRT scheme is desirable for a high-dimensional and high-security IoMT application while Mask-NFRT scheme is desirable for a high-dimensional and large-scale IoMT application.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tnnls.2023.3271859

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 System model of HE-NFRT and Mask-NFRT.
Fig. 1 System model of HE-NFRT and Mask-NFRT.CC-BY · From the PDF
Image 2
CC-BY · From the PDF
Image 3
CC-BY · From the PDF
Image 4
CC-BY · From the PDF
Fig. 7 Accuracy evaluation with the UCI-PT and UCI-CT datasets. (a) UCI-PT with no dropout. (b) UCI-PT with 5% dropout. (c) UCI-PT with 10% dropout. (d) UCI-PT with 15% dropout. (e) UCI-CT with no dropout. (f) UCI-CT with 5% dropout. (g) UCI-CT with 10% dropout. (h) UCI-CT with 15% dropout.
Fig. 7 Accuracy evaluation with the UCI-PT and UCI-CT datasets. (a) UCI-PT with no dropout. (b) UCI-PT with 5% dropout. (c) UCI-PT with 10% dropout. (d) UCI-PT with 15% dropout. (e) UCI-CT with no dropout. (f) UCI-CT with 5% dropout. (g) UCI-CT with 10% dropout. (h) UCI-CT with 15% dropout.CC-BY · From the PDF

Verification

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 42 references

Research works printed but not linked: 5

  1. Graf, 2011, Relative Location of CT Slices on Axial Axis Data Set
  2. Yann, 1998, The MNIST Database of Handwritten Digits
  3. Alex, 2009, The CIFAR-10 Dataset
  4. Lynn, 2000, Pairing-Based Cryptography (PBC) Library
  5. Huang, Cheetah: Lean and fast secure two-party deep neural network inference, 1

Cited by

See all 61

Metadata

Authors
Han, S., Ding, H., Zhao, S., Ren, S., Wang, Z., Lin, J., & Zhou, S.
Affiliations
  • Hangzhou City University (CN)
  • Zhejiang Gongshang University (CN)
  • Zhejiang University (CN)
  • Zhejiang Ponshine Information Technology Company Ltd., Hangzhou, China
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2024-10
Volume
35
Issue
10
Pages
13801-13815
ISSN
  • 2162-237X (ISSN-L)
  • 2162-2388
OpenAlex
W4379805355
Cited by
60
References
42
Citations by year
2026: 9 · 2025: 16 · 2024: 15
FWCI
5.66
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Neural Networks and Learning Systems (publishedVersion, cc-by)
  • PubMed (publishedVersion)
Funders
  • National Natural Science Foundation of China (62072403, U20A20182, 61906167)
  • Zhejiang Provincial Natural Science Foundation of China (LQ22F020001, LTY21F020001)
  • Ministry of Education Humanities and Social Sciences General Project (22JDSZ3124)
  • Scientific Research Fund of Zhejiang Provincial Education Department (Y202147355)
  • Laboratory Work Research Project of Universities in Zhejiang (20220003)
  • “Pioneer” and “Leading Goose” R&D Program of Zhejiang (2022C01243)
  • Key Research and Development Program of Zhejiang Province (2020C01076)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
Keywords
privacy-preserving federated learning, Internet of Medical Things, homomorphic encryption, collusion resistance, scalability, high-dimensional data, cloud service provider security

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Practical and Robust Federated Learning With Highly Scalable Regression Training. https://app.cochat.ai/papers/10.1109/tnnls.2023.3271859
The paper
Han, S., Ding, H., Zhao, S., Ren, S., Wang, Z., Lin, J., & Zhou, S. (2024). Practical and Robust Federated Learning With Highly Scalable Regression Training. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2023.3271859

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.