PNFR: practicality-enhanced and non-interactive privacy-preserving federated regressions
Clicks: 8
ID: 326957
2026
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
2.1
/100
8 views
7 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #36 of 38 articles by views in The Computer Journal
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Abstract Federated learning is a technology that is used to protect data privacy in machine learning. Nonetheless, in federated learning, updating the global model requires the use of gradient descent algorithm, which involves multiple rounds of interaction between entities to complete the iterative updates, inevitably incurring massive computational and communication overhead. In 2020, Wang et al. first proposed a non-interactive federated regression scheme, which effectively improves the training efficiency of regression models while protecting the privacy of local training data. However, like most current federated regressions, it involves a third authority (TA) to generate keys for each entity, which poses a significant privacy risk and results in considerable communication overhead. From the view of security and practicality, this paper first proposes a multi-party homomorphic encryption algorithm named MPaillier. Furthermore, we have designed PNFR, a privacy-preserving federated learning scheme for regressions training built on the MPaillier algorithm. The participating entities of PNFR are the data owners and a cloud server, eliminating the need for a TA, thus enhancing the practicality and efficiency of the scheme. Experimental results demonstrate that our scheme is $\sim 10^{3}$ times faster than interactive federated regressions PrivFL and about 80% faster than non-interactive federated regressions VANE.
| Reference Key |
openalex_W7206154085
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Huiyu Xie, Tanping Zhou, Shuo Chen, Yu Li, Xiaoyuan Yang |
| Journal | The Computer Journal |
| Year | 2026 |
| DOI |
10.1093/comjnl/bxag085
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.