Jul 2026· International Conference on Computer Communications and Networks· pp. 1-6· 0 citations· 33 references
Abstract
Federated Learning (FL) enables collaborative model training without centralizing client data, making it well-suited for privacy-sensitive domains. Existing approaches use techniques such as homomorphic encryption, differential privacy, and secure multi-party computation to mitigate attacks including model inversion, membership inference, and gradient leakage. However, these methods often incur high computational and memory overheads and frequently overlook confidentiality of the global model itself, which may be proprietary and sensitive. These limitations reduce the practicality of secure FL in large-scale and compliance-sensitive environments.We present NETFL, a Fully Secure and scalable FL framework that decentralizes training across client pairs using lightweight MPC, while restricting servers to secure aggregation, client pairing, and routing. NETFL eliminates server-side bottlenecks, avoids full data offloading, and preserves confidentiality of data, model parameters, and updates throughout training. Our evaluation shows that NETFL protects against unauthorized observation, reconstruction, gradient leakage, membership inference, and inversion attacks, while achieving up to 13× faster training time and 50% lower server memory usage compared to prior work.
This work proposes PRoVeFL-a novel, modular FL framework that is Privacy-preserving, Byzantine-Robust, and ensures Verifiable aggregation, and improves runtime over the prior works, Prio and ELSA, based on distributed trust with comparable security guarantees, up to 100x and 10x, respectively.
Harsh Kasyap, Anil Kumar Pradhan, U. Atmaca et al.· 0 citations
Federated learning alleviates data silos through a “data-local, model-global” paradigm, but transmitting plaintext gradients exposes clients to reconstruction attacks from malicious servers. Existing secure aggregation methods face trade-offs among privacy, accuracy, and efficiency: homomorphic encryption incurs high overhead, differential privacy sacrifices accuracy, and lightweight secret-sharing schemes often lack weighted aggregation support and suffer accuracy degradation as client numbers grow. To address these limitations, we propose SecAGG, a lossless secure weighted aggregation scheme based on additive secret sharing. SecAGG adopts a three-tier architecture consisting of client clusters, cooperative servers, and a super server. Clients split weighted model parameters into random shares and distribute them to cooperative servers, which perform encrypted partial aggregation before the super server securely reconstructs the global model. Experimental results demonstrate that SecAGG achieves strict security against up to M-1 colluding servers under the semi-honest model while preserving FedAvg-equivalent accuracy with minimal computation and communication overhead, effectively balancing privacy, accuracy, and efficiency.
Xiaomei Tian· 2026 3rd World Conference on...· 0 citations
This work proposes a lightweight and information-theoretically secure aggregation framework that securely computes the majority vote (MV) polynomial through single-round secure multiplication, ensuring end-to-end information-theoretic security under the honest-majority assumption while revealing only the final aggregated sign to the server.
Secure Federated Learning protects user privacy by keeping local gradients within the ciphertext space, thereby preventing direct exposure of raw gradients during aggregation. Paradoxically, this very protection introduces a fundamental vulnerability: the opacity of encrypted gradients blinds the server, rendering honest and malicious gradients indistinguishable. An attacker can exploit this opacity to inject manipulated gradients directly into the secure aggregation process, compromising the integrity of the global model. To address this issue, we propose SFLBR, a novel Byzantine-robust Secure Federated Learning framework. Specifically, we adopt the gradient median as a robust benchmark and introduce a layer-wise cosine similarity metric to differentiate malicious gradients. Furthermore, considering the complexity of non-independent and identically distributed (Non-IID) scenarios, we further design a proactive defense strategy that constrains the divergence among honest gradients, and augment it with a trust score function to improve robustness against potential misjudgments. Finally, we construct a series of secure communication protocols based on a lightweight dual-masking encryption mechanism, which enable efficient robust aggregation directly within the ciphertext space. Extensive experiments validate the effectiveness of SFLBR, demonstrating state-of-the-art (SOTA) defense performance across diverse attack scenarios.
Jinbo Wang, Ruijin Wang, Zengpeng Li et al.· IEEE Transactions on Informa...· 0 citations
Federated learning (FL) is a machine learning technique where multiple clients with local data collaborate in training a machine learning model. However, this centralization of sensitive model updates incurs security and privacy issues. A malicious aggregator can launch inference attacks to violate the privacy of clients' private data from local models and explore sensitive knowledge from global model. Trusted Execution Environment (TEE) based schemes offer secure enclaves to protect models privacy during the aggregation procedure. However, TEE technologies incur new functional and security assumptions, where a single vulnerability could undermine the trusted system. Cryptographic schemes such as homomorphic encryption (HE), differential privacy (DP) and secret sharing (SS) cannot achieve the simultaneous requirements of efficiency, accuracy and privacy currently. In this paper, we present DoshFL that avoids expensive cryptographic operations and enables tunable trade-off between privacy and efficiency in federated learning for model asset protection.
Jia-Ming Fang· 2026 3rd World Conference on...· 0 citations
Federated learning (FL) enables collaborative model training across multiple clients in a privacy-preserving manner. However, the employment of homomorphic encryption algorithms might lead to high computational cost while the application of differential privacy (DP) methods would sacrifice model performance. To establish efficient and secure FL system as well as maintaining competitive performance, we introduce a DP-enabled cascaded filter with novel model-aggregation mechanism. Taking the model parameters of one client for example, dimensions with large absolute values and significant variations are selected by the cascaded filter and regarded as important dimensions. After that, random noise are added to these important dimensions for data security. Finally, the model parameters will be sent to the central server for aggregation. Unlike traditional DP-based approaches, our method considers each dimension’s informational importance, i.e., both absolute value and its variation. We theoretically prove the convergence of our method and verify the effectiveness on different scenarios including four datasets. The experimental results suggest that our method outperforms the other ones from literature under both IID and non-IID conditions while achieving high level of efficiency and privacy protection performance.
Zhiqiang Chen, Yuchen Jiang, Ray Y. Zhong et al.· IEEE Transactions on Informa...· 0 citations