HERL: Tiered Federated Learning with Adaptive Homomorphic Encryption using Reinforcement Learning
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917774579728384 |
|---|---|
| author | Tang, Jiaxang Fayyaz, Zeshan Salahuddin, Mohammad A. Boutaba, Raouf Zhang, Zhi-Li Anwar, Ali |
| author_facet | Tang, Jiaxang Fayyaz, Zeshan Salahuddin, Mohammad A. Boutaba, Raouf Zhang, Zhi-Li Anwar, Ali |
| contents | Federated Learning is a well-researched approach for collaboratively training machine learning models across decentralized data while preserving privacy. However, integrating Homomorphic Encryption to ensure data confidentiality introduces significant computational and communication overheads, particularly in heterogeneous environments where clients have varying computational capacities and security needs. In this paper, we propose HERL, a Reinforcement Learning-based approach that uses Q-Learning to dynamically optimize encryption parameters, specifically the polynomial modulus degree, $N$, and the coefficient modulus, $q$, across different client tiers. Our proposed method involves first profiling and tiering clients according to the chosen clustering approach, followed by dynamically selecting the most suitable encryption parameters using an RL-agent. Experimental results demonstrate that our approach significantly reduces the computational overhead while maintaining utility and a high level of security. Empirical results show that HERL improves utility by 17%, reduces the convergence time by up to 24%, and increases convergence efficiency by up to 30%, with minimal security loss. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_07631 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | HERL: Tiered Federated Learning with Adaptive Homomorphic Encryption using Reinforcement Learning Tang, Jiaxang Fayyaz, Zeshan Salahuddin, Mohammad A. Boutaba, Raouf Zhang, Zhi-Li Anwar, Ali Cryptography and Security Distributed, Parallel, and Cluster Computing Federated Learning is a well-researched approach for collaboratively training machine learning models across decentralized data while preserving privacy. However, integrating Homomorphic Encryption to ensure data confidentiality introduces significant computational and communication overheads, particularly in heterogeneous environments where clients have varying computational capacities and security needs. In this paper, we propose HERL, a Reinforcement Learning-based approach that uses Q-Learning to dynamically optimize encryption parameters, specifically the polynomial modulus degree, $N$, and the coefficient modulus, $q$, across different client tiers. Our proposed method involves first profiling and tiering clients according to the chosen clustering approach, followed by dynamically selecting the most suitable encryption parameters using an RL-agent. Experimental results demonstrate that our approach significantly reduces the computational overhead while maintaining utility and a high level of security. Empirical results show that HERL improves utility by 17%, reduces the convergence time by up to 24%, and increases convergence efficiency by up to 30%, with minimal security loss. |
| title | HERL: Tiered Federated Learning with Adaptive Homomorphic Encryption using Reinforcement Learning |
| topic | Cryptography and Security Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2409.07631 |