This work proposes lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption, which substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
Abstract
Federated Learning enables multiple clients to train a shared model while keeping their local datasets isolated. However, the exchanged model updates may still leak sensitive information, making private aggregation a central building block in practical deployments, especially in the cross-silo setting. Homomorphic Encryption naturally fits the client--aggregator communication pattern of Federated Learning, but conventional single-key deployments rely on strong non-collusion assumptions. Multiparty Homomorphic Encryption removes this limitation, although recent attacks under restricted decryption access require large-variance smudging noise during collaborative decryption, which significantly increases ciphertext size and implementation complexity. In this work, we propose lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption. Our construction departs from the usual multiparty blueprint by avoiding the generation of a collective public key. Instead, each client encrypts its update under its own secret key, while the resulting ciphertexts remain compatible with homomorphic aggregation and collaborative decryption. By explicitly tracking and cancelling the ciphertext noise during decryption, the protocol removes the need for large $\lambda$-dependent smudging noise. We instantiate the construction with both exact BFV-based and approximate CKKS-based variants, prove its security in the semi-honest model against an adversary corrupting the aggregator and up to $L-1$ clients, and compare its communication and runtime performance with state-of-the-art MHE-based aggregation. Our results show that the proposed approach substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
This paper proposes DMSA-FL as a practical and robust FL framework leveraging double-masked secure aggregation integrated with multiparty homomorphic encryption, and designs a strategy that encrypts only low-dimensional mask seeds rather than high-dimensional gradients.
Wen-Hao Liu, Xu-An Wang, Wei-Wei Jiang et al.· Journal of King Saud Univers...· 0 citations
SEREK is a practical and efficient encrypted keyword-search protocol for privacy-preserving messaging that combines homomorphic encryption with secure two-party computation (2PC) and achieves 100% accuracy under case variations that result in exact-matching failures, without requiring additional trapdoors or online com...
This work proposes a practical Ring Learning with Errors (Ring-LWE) public-key encryption scheme supporting public re-randomization without ciphertext growth.
D. Vodenicarevic, Andrei Fleiser, Pierre Seznec et al.· Journal of Cryptographic Eng...· 1 citation
Dynamic Searchable Symmetric Encryption (DSSE) enables efficient searches over encrypted data but often suffers from search pattern leakage, allowing adversaries to infer sensitive information. While schemes using Oblivious RAM (ORAM) mitigate leakage, their high cost hinders large-scale applications. Dory adopts a mul...
Man-Yue Hu, Cong Zuo, Shu-Jie Cui et al.· IEEE Transactions on Informa...· 0 citations
Federated Learning (FL) facilitates collaborative training of models without exchanging any data, thereby ensuring data locality. However, the exchange of local model updates is still susceptible to attacks such as gradient inference, model reconstruction, man-in-the-middle, replay, and tampering, which create consider...
V. Naresh, Sivaranjani Reddi, M. H. M. Krishna Prasad· Journal of King Saud Univers...· 0 citations
PVeriFL is a federated learning framework that integrates privacy preservation, Byzantine fault tolerance, and lightweight client-side verifiability and effectively unifies the three security objectives, offering a practical and trustworthy solution for real-world federated learning systems.
Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduNov 17, 2026
By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.
Microsoft Research Blog· microsoft.comNov 16, 2026
AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.