2026· IEEE Transactions on Information Forensics and Security· Vol 21, pp. 7709-7722· 0 citations· 45 references
Abstract
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.
It was concluded that strategies such as the careful selection of differential privacy parameters and training settings, along with the use of larger datasets, can improve the efficiency of FL and demonstrate that privacy-preserving and high-performance artificial intelligence systems can be securely applied in sensitive domains such as healthcare and finance.
Cagdas Karatas, Hibanur Karadogan, A. Ertug et al.· 0 citations
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.
Sahar Ghoflsaz Ghinani, Elaheh Sadredini· International Conference on...· 0 citations
This study implemented a comprehensive experimental framework for analysing FL performance using standard FL aggregation protocols FedAvg, FedProx, and SCAFFOLD in conjunction with Differential Privacy mechanisms; specifically, the Gaussian noise mechanism with Rényi Differential Privacy (RDP) accountants.
Federated learning (FL) offers a decentralized approach to machine learning that preserves data privacy by training models locally across distributed devices. However, the feature engineering process—an essential step in improving model performance—often remains centralized or privacy-invasive, risking sensitive data exposure. This paper proposes a comprehensive framework for privacy-preserving feature engineering (PPFE) within federated learning analytics. We explore techniques such as homomorphic encryption, differential privacy, and secure multi-party computation to enable robust, privacy-safe feature selection, transformation, and extraction across clients. Our framework includes both vertical and horizontal FL settings and evaluates the trade-offs between privacy, utility, and communication overhead. Experimental results on real-world datasets demonstrate that our PPFE methods can significantly improve model performance without compromising data privacy. This work contributes towards building a more secure and efficient FL pipeline that ensures end-to-end data confidentiality.
Yuki Nakamura, Olivia Martin· International Journal of Dat...· 0 citations
Deep learning is becoming popular in cloud applications and serves to provide intelligent services; data aggregation in a central location makes sensitive information vulnerable to privacy breaches, regulatory infractions, and adversarial manipulation. All modern privacy mechanisms offer partial protection and frequently lack accuracy, scalability, or practicality in their operations. To overcome these limitations, a federated deep learning model is formulated so that secure joint learning can occur without transferring raw data across the domains of ownership. The framework incorporates training that is decentralized, training that uses differential privacy, training that uses secure aggregation, training that uses encrypted communication, and training that uses trust-based anomaly defense to defend against leakage, poisoning, and inference attacks. It also supports heterogeneous and highly non-IID datasets using adaptive coordination and stability-relevant participation regulation and meets emerging data protection requirements. The methods of resource-conscious orchestration and the optimization of communication eliminate overhead without obstructing the effectiveness of learning. The paradigm has therefore formed a privacy-by-design intelligent cloud ecosystem which ensures confidentiality, maintains performance, enhances robustness, and ensures responsible AI implementation in privacy-related sectors of healthcare, finance, governance, and smart infrastructure.
Sribidhya Mohanty, Pallavi Gupta, Anil Pratap Singh et al.· 2026 International Conferenc...· 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.
