Secure Aggregation in Federated Learning using Multiparty Homomorphic Encryption

• URL: http://arxiv.org/abs/2503.00581v1
• Date: Sat, 01 Mar 2025 18:19:25 GMT
• Title: Secure Aggregation in Federated Learning using Multiparty Homomorphic Encryption
• Authors: Erfan Hosseini, Shuangyi Chen, Ashish Khisti,
• Abstract summary: A key operation in federated learning is the aggregation of gradient vectors generated by individual client nodes.<n>We develop a method based on multiparty homomorphic encryption (MPHE) that enables the central node to compute this aggregate.<n>We extend classical MPHE methods so that the decryption of the aggregate vector can be successful even when only a subset of client nodes are available.
• Score: 17.98928470989766
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A key operation in federated learning is the aggregation of gradient vectors generated by individual client nodes. We develop a method based on multiparty homomorphic encryption (MPHE) that enables the central node to compute this aggregate, while receiving only encrypted version of each individual gradients. Towards this end, we extend classical MPHE methods so that the decryption of the aggregate vector can be successful even when only a subset of client nodes are available. This is accomplished by introducing a secret-sharing step during the setup phase of MPHE when the public encryption key is generated. We develop conditions on the parameters of the MPHE scheme that guarantee correctness of decryption and (computational) security. We explain how our method can be extended to accommodate client nodes that do not participate during the setup phase. We also propose a compression scheme for gradient vectors at each client node that can be readily combined with our MPHE scheme and perform the associated convergence analysis. We discuss the advantages of our proposed scheme with other approaches based on secure multi-party computation. Finally we discuss a practical implementation of our system, compare the performance of our system with different approaches, and demonstrate that by suitably combining compression with encryption the overhead over baseline schemes is rather small.

Related papers

• Practical Secure Aggregation by Combining Cryptography and Trusted Execution Environments [1.3068730884406587]
  Secure aggregation enables a group of mutually distrustful parties, each holding private inputs, to collaboratively compute an aggregate value. A major challenge in adopting secure aggregation approaches for practical applications is the significant computational overhead of the underlying cryptographic protocols. Hardware-based security techniques such as trusted execution environments (TEEs) enable computation at near-native speeds. In this work, we introduce several secure aggregation architectures that integrate both cryptographic and TEE-based techniques.
  arXiv  Detail & Related papers  (2025-04-11T07:49:09Z)
• NET-SA: An Efficient Secure Aggregation Architecture Based on In-Network Computing [10.150846654917753]
  NET-SA is an efficient secure aggregation architecture for machine learning. It reduces communication overhead due to eliminating the communication-intensive phases of seed agreement and secret sharing. It achieves up to 77x and 12x enhancements in runtime and 2x decrease in total client communication cost compared with state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-01-02T10:27:06Z)
• Multi-client Functional Encryption for Set Intersection with Non-monotonic Access Structures in Federated Learning [1.2891210250935148]
  Federated learning (FL) based on cloud servers is a distributed machine learning framework.<n>We propose a multi-client functional encryption scheme for set intersection with non-monotonic access structures.
  arXiv  Detail & Related papers  (2024-12-12T13:19:12Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Secure and Scalable Circuit-based Protocol for Multi-Party Private Set Intersection [4.946124980718068]
  Circuit-based approach has advantages over using custom protocols to achieve this task. By using secure computation between two parties, our protocol sidesteps the complexities associated with multi-party interactions. In order to mitigate the high overhead associated with circuit-based constructions, we have further enhanced our protocol by utilizing simple hashing scheme and permutation-based hash functions.
  arXiv  Detail & Related papers  (2023-09-14T03:20:33Z)
• An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
  We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
  arXiv  Detail & Related papers  (2023-06-15T09:05:36Z)
• Provably Personalized and Robust Federated Learning [47.50663360022456]
  We propose simple algorithms which identify clusters of similar clients and train a personalized modelper-cluster. The convergence rates of our algorithmsally match those obtained if we knew the true underlying clustering of the clients and are provably robust in the Byzantine setting.
  arXiv  Detail & Related papers  (2023-06-14T09:37:39Z)
• ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment [90.60126724503662]
  ByzSecAgg is an efficient secure aggregation scheme for federated learning. ByzSecAgg is protected against Byzantine attacks and privacy leakages.
  arXiv  Detail & Related papers  (2023-02-20T11:15:18Z)
• ScionFL: Efficient and Robust Secure Quantized Aggregation [36.668162197302365]
  We introduce ScionFL, the first secure aggregation framework for federated learning. It operates efficiently on quantized inputs and simultaneously provides robustness against malicious clients. We show that with no overhead for clients and moderate overhead for the server, we obtain comparable accuracy for standard FL benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T21:46:55Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Beyond the Prototype: Divide-and-conquer Proxies for Few-shot Segmentation [63.910211095033596]
  Few-shot segmentation aims to segment unseen-class objects given only a handful of densely labeled samples. We propose a simple yet versatile framework in the spirit of divide-and-conquer. Our proposed approach, named divide-and-conquer proxies (DCP), allows for the development of appropriate and reliable information.
  arXiv  Detail & Related papers  (2022-04-21T06:21:14Z)
• Communication-Efficient Federated Learning via Quantized Compressed Sensing [82.10695943017907]
  The presented framework consists of gradient compression for wireless devices and gradient reconstruction for a parameter server. Thanks to gradient sparsification and quantization, our strategy can achieve a higher compression ratio than one-bit gradient compression. We demonstrate that the framework achieves almost identical performance with the case that performs no compression.
  arXiv  Detail & Related papers  (2021-11-30T02:13:54Z)
• Fully Convolutional Networks for Panoptic Segmentation [91.84686839549488]
  We present a conceptually simple, strong, and efficient framework for panoptic segmentation, called Panoptic FCN. Our approach aims to represent and predict foreground things and background stuff in a unified fully convolutional pipeline. Panoptic FCN encodes each object instance or stuff category into a specific kernel weight with the proposed kernel generator.
  arXiv  Detail & Related papers  (2020-12-01T18:31:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.