entropy-logo

Journal Browser

Journal Browser

Secure Aggregation for Federated Learning and Distributed Computation

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: 31 October 2026 | Viewed by 1705

Special Issue Editors


E-Mail Website
Guest Editor
Department of Electrical Engineering and Computer Science, Technical University of Berlin, Berlin, Germany
Interests: information-theoretic security and privacy; secure aggregation; federated learning; private information retrieval (PIR); distributed computing

E-Mail Website
Guest Editor
Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA
Interests: information theory; machine learning; communication and networking; optimization

Special Issue Information

Dear Colleagues,

Federated learning (FL) enables collaborative model training across distributed clients while preserving data privacy. A core challenge in FL—and, more broadly, in distributed computation (DC)—is secure aggregation, which is ensuring that individual inputs, such as gradients and/or weights of deep neural network (DNN) models, remain confidential during the computation of global functions. While cryptographic methods offer practical solutions, information-theoretic approaches provide unconditional privacy guarantees, making them especially valuable for sensitive or adversarial environments.

Recent advances have applied Shannon-theoretic tools to characterize the fundamental limits of secure aggregation, design provably secure protocols, and analyze robustness under dynamic participation, partial trust, or collusion. These insights not only benefit FL but also inform the broader study of secure multi-party computation and privacy-preserving protocols in distributed learning systems.

Despite the progress, many open challenges remain. Key challenges include the tradeoff between communication and secret key rates, the impact of network topology on security and communication efficiency, and the applicability of information/coding-theoretic methods to adversarial environments. Bridging these gaps requires deeper integration between information theory, distributed optimization, and privacy-preserving machine learning. 

This Special Issue welcomes original contributions that explore the use of information-theoretic tools and techniques to enhance the privacy, efficiency, and robustness of secure aggregation in federated learning and distributed computation. Topics of interest include, but are not limited to, the following:

  • Fundamental limits and rate region characterizations;
  • Protocol design with provable security and robustness guarantees;
  • Key generation and coordination schemes;
  • Secure aggregation over general network topologies;
  • Information-theoretic analysis under realistic system constraints and attack models;
  • Experimental validation of theory-inspired secure FL/DC protocols. 

Dr. Xiang Zhang
Dr. Mingyue Ji
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • federated learning
  • secure aggregation
  • distributed computing
  • information-theoretic security
  • privacy-preserving machine learning
  • secret key generation
  • communication efficiency
  • linearly separable distributed computation
  • robustness

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

49 pages, 2023 KB  
Article
Secure Multiplicative Aggregation and Key-Reuse Optimization: Achieving Dropout Resilience with Amortized Efficiency
by Hongyuan Cai, Bei Liang, Yue Qin and Jintai Ding
Entropy 2026, 28(3), 358; https://doi.org/10.3390/e28030358 - 22 Mar 2026
Viewed by 296
Abstract
We present the first secure multiplicative aggregation protocol as a variant of secure aggregation. In this case, a server can compute the component-wise product of the input vectors of users while handling the possible dropout of users during protocol execution. Using pairwise masks, [...] Read more.
We present the first secure multiplicative aggregation protocol as a variant of secure aggregation. In this case, a server can compute the component-wise product of the input vectors of users while handling the possible dropout of users during protocol execution. Using pairwise masks, threshold secret sharing and the secure aggregation protocol itself, our construction is correct and secure against semi-honest adversaries. We also consider secure aggregation protocols for the case in which fixed users can reuse their private keys to do aggregation many times, and we propose key reusable secure aggregation protocols. Our protocols have an overhead polynomial in the number of users. We conduct a comprehensive evaluation of our proposed protocols. For multiplicative aggregation protocol, experiments varying the number of users (K) from 50 to 300 (with fixed input size Xu=100 KB) demonstrate that user computation scales monotonically with K and is largely insensitive to dropout rates. In contrast, server computation is highly dropout-sensitive and exhibits a steeper growth rate with respect to K. When varying the input size (10–250 KB) with a fixed K, both user and server communication overheads increase linearly, while server computation remains the primary bottleneck affected by dropouts. We compare reusable and non-reusable secure aggregation protocol over repeated interactions q{1,,10} at Xu=100 KB and K=100, showing that reusing Round 1 reduces the cumulative user computation time by about 2.5 times and reduces the cumulative server computation overhead by about 1.2 times at q=10 while leaving the server communication overhead nearly unchanged, which indicates that the overall communication overhead is dominated by the non-reused rounds. Full article
(This article belongs to the Special Issue Secure Aggregation for Federated Learning and Distributed Computation)
Show Figures

Figure 1

19 pages, 1416 KB  
Article
On the Communication–Key Rate Region of Hierarchical Vector Linear Secure Aggregation
by Jiawen Lv, Xiang Zhang and Zhou Li
Entropy 2026, 28(3), 352; https://doi.org/10.3390/e28030352 - 20 Mar 2026
Viewed by 259
Abstract
Motivated by heterogeneous data distributions and task-dependent aggregation requirements in federated learning, we study information-theoretic secure aggregation of linear functions over a two-hop hierarchical network. The system comprises an aggregation server, an intermediate layer of U relays, and UV users, where each [...] Read more.
Motivated by heterogeneous data distributions and task-dependent aggregation requirements in federated learning, we study information-theoretic secure aggregation of linear functions over a two-hop hierarchical network. The system comprises an aggregation server, an intermediate layer of U relays, and UV users, where each relay serves a disjoint cluster of V users. Each relay observes all uplink transmissions within its cluster and forwards a coded message to the server. The server is authorized to compute a prescribed linear function F of the users’ inputs with zero error, while being prevented from learning any additional information about an unauthorized linear function G. Moreover, each relay must obtain no information about any non-trivial linear function Bu of the inputs in its own cluster. We define the communication rates on both hops as the number of transmitted symbols per input symbol. By deriving matching information-theoretic converse and achievability bounds, we fully characterize the optimal communication rates and propose an explicit linear coding scheme that achieves the resulting optimal region. Our results demonstrate that hierarchical architectures can attain optimal communication rates while substantially reducing the server-side masking burden, thereby enabling scalable secure aggregation of authorized linear functions. Full article
(This article belongs to the Special Issue Secure Aggregation for Federated Learning and Distributed Computation)
Show Figures

Figure 1

17 pages, 346 KB  
Article
Locally Encoded Secure Distributed Batch Matrix Multiplication
by Haobo Jia and Zhuqing Jia
Entropy 2025, 27(12), 1231; https://doi.org/10.3390/e27121231 - 5 Dec 2025
Viewed by 457
Abstract
We study the problem of locally encoded secure distributed batch matrix multiplication (LESDBMM), where M pairs of sources each encode their respective batches of massive matrices and distribute the generated shares to a subset of N worker nodes. Each worker node computes a [...] Read more.
We study the problem of locally encoded secure distributed batch matrix multiplication (LESDBMM), where M pairs of sources each encode their respective batches of massive matrices and distribute the generated shares to a subset of N worker nodes. Each worker node computes a response from the received shares and sends the result to a sink node, which must be able to recover all M batches of pairwise matrix products in the presence of up to S stragglers. Additionally, any set of up to X colluding workers cannot learn any information about the matrices. Based on the idea of cross-subspace (CSA) codes and CSA null shaper, we propose the first LESDBMM scheme for batch processing. When the problem reduces to the coded distributed batch matrix multiplication (CDBMM) setting where M=1,X=0 and every source distributes its share to all worker nodes, the proposed scheme achieves performance matching that of the cross-subspace alignment (CSA) codes for CDBMM in terms of the maximum number of tolerable stragglers, communication cost, and computational complexity. Therefore, our scheme can be viewed as a generalization of CSA codes for CDBMM to the LESDBMM setting. Full article
(This article belongs to the Special Issue Secure Aggregation for Federated Learning and Distributed Computation)
Show Figures

Figure 1

Back to TopTop