kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Homomorphic-encryption-based Decentralized Federated Learning
School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China.
College of Computer and Information Science, Southwest University, Chongqing, China.
School of Computer Science and Engineering, University of New South Wales, Sydney, Australia.
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0003-2659-863X
Show others and affiliations
2025 (English)In: ICC 2025 - IEEE International Conference on Communications, Institute of Electrical and Electronics Engineers (IEEE) , 2025, p. 6747-6752Conference paper, Published paper (Refereed)
Abstract [en]

To meet the requirements of the artificial internet of things (AIoT), decentralization is essential to provide wide coverage, trustworthiness, and low-latency communication. For this purpose, decentralized federated learning (DFL) has rapidly evolved and gained popularity in recent years by reducing reliance on a central server and promoting a more robust, scalable, and privacy-preserving system. Nevertheless, the exchange of model updates and gradients in peer-to-peer (P2P) wireless communication systems introduces new vulnerabilities that threaten both model performance and data security, while frequent P2P communication among clients can lead to high communication costs. To address these issues, in this work, we develop a communicationefficient and security-enhanced DFL algorithm, which integrates the fast incremental alternating direction method of multipliers (FI-ADMM) algorithm with parameter-selective additively homomorphic encryption. Additionally, by introducing a first-order approximation for primal updates and rearranging the update order in FI-ADMM, the proposed method is superior to the other benchmarks in terms of computational and time complexity, which is validated by theoretical analysis and simulations.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2025. p. 6747-6752
Keywords [en]
alternating direction method of multipliers (ADMM), Decentralized federated learning, homomorphic encryption
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-372518DOI: 10.1109/ICC52391.2025.11160999ISI: 001707176400195Scopus ID: 2-s2.0-105018474747OAI: oai:DiVA.org:kth-372518DiVA, id: diva2:2012392
Conference
2025 IEEE International Conference on Communications, ICC 2025, Montreal, Canada, June 8-12, 2025
Note

Part of ISBN 9798331505219

QC 20251107

Available from: 2025-11-07 Created: 2025-11-07 Last updated: 2026-05-29Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

You, Yang

Search in DiVA

By author/editor
You, Yang
By organisation
Information Science and Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 40 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf