Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.05162 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914069036924928 |
|---|---|
| author | Bottoni, Simone Zizzo, Giulio Braghin, Stefano Trombetta, Alberto |
| author_facet | Bottoni, Simone Zizzo, Giulio Braghin, Stefano Trombetta, Alberto |
| contents | Federated Learning has rapidly expanded from its original inception to now have a large body of research, several frameworks, and sold in a variety of commercial offerings. Thus, its security and robustness is of significant importance. There are many algorithms that provide robustness in the case of malicious clients. However, the aggregator itself may behave maliciously, for example, by biasing the model or tampering with the weights to weaken the models privacy. In this work, we introduce a verifiable federated learning protocol that enables clients to verify the correctness of the aggregators computation without compromising the confidentiality of their updates. Our protocol uses a standard secure aggregation technique to protect individual model updates with a linearly homomorphic authenticator scheme that enables efficient, privacy-preserving verification of the aggregated result. Our construction ensures that clients can detect manipulation by the aggregator while maintaining low computational overhead. We demonstrate that our approach scales to large models, enabling verification over large neural networks with millions of parameters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_05162 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Verifiability and Privacy in Federated Learning through Context-Hiding Multi-Key Homomorphic Authenticators Bottoni, Simone Zizzo, Giulio Braghin, Stefano Trombetta, Alberto Cryptography and Security Federated Learning has rapidly expanded from its original inception to now have a large body of research, several frameworks, and sold in a variety of commercial offerings. Thus, its security and robustness is of significant importance. There are many algorithms that provide robustness in the case of malicious clients. However, the aggregator itself may behave maliciously, for example, by biasing the model or tampering with the weights to weaken the models privacy. In this work, we introduce a verifiable federated learning protocol that enables clients to verify the correctness of the aggregators computation without compromising the confidentiality of their updates. Our protocol uses a standard secure aggregation technique to protect individual model updates with a linearly homomorphic authenticator scheme that enables efficient, privacy-preserving verification of the aggregated result. Our construction ensures that clients can detect manipulation by the aggregator while maintaining low computational overhead. We demonstrate that our approach scales to large models, enabling verification over large neural networks with millions of parameters. |
| title | Verifiability and Privacy in Federated Learning through Context-Hiding Multi-Key Homomorphic Authenticators |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2509.05162 |