AEPPFL: Accurate and Efficient Privacy Protection Federal Learning in Industrial IoT
- Authors
- Li, Gongli; Lei, Hongzhi; Liu, Fangfang; Li, Lu; Jin, Hu
- Issue Date
- Jul-2025
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Computational modeling; Servers; Privacy; Training; Accuracy; Industrial Internet of Things; Data privacy; Cryptography; Protection; Data models; Masking techniques; computational Diffie-Hellman (CDH); Industrial Internet of Things (IIoT); inference attack; secure aggregation
- Citation
- IEEE INTERNET OF THINGS JOURNAL, v.12, no.14, pp 27193 - 27205
- Pages
- 13
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE INTERNET OF THINGS JOURNAL
- Volume
- 12
- Number
- 14
- Start Page
- 27193
- End Page
- 27205
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/126125
- DOI
- 10.1109/JIOT.2025.3562064
- ISSN
- 2372-2541
2327-4662
- Abstract
- Machine learning in the application of Industrial Internet of Things (IIoT) has great potential. However, traditional machine learning methods require collecting user data for centralized training, which may disclose sensitive information of enterprises. To solve this problem, federated learning (FL) technology with distributed training has emerged. However, FL is not infallible, as attackers retain the capability to launch inference attacks on the local models, thereby deducing sensitive information about the original data. To address this issue, this article proposes an accurate and efficient FL solution for IIoT (AEPPFL). It employs masking techniques to safeguard local model parameters and encrypts the masks using lightweight keys generated from the computational Diffie-Hellman (CDH) problem. Without obtaining any precise local models from clients, the server can still perform accurate aggregation. Furthermore, this solution operates independently of secure channels and eliminates the need for shared keys. It can protect clients' local model parameters from inference attacks with minimal precision loss while maintaining low computation and communication overheads. For example, our proposed method demonstrates significant improvements over recent state-of-the-art approaches, achieving at least a 42.3x reduction in runtime when the number of clients is 500 and the data vector size is 50K.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.