Return
Secure and efficient federated learning using attribute-based homomorphic encryption
DOI:10.1016/j.jisa.2026.104564.png)
Abstract
En 中文
• Proposes a Ciphertext-Policy Attribute-Based Homomorphic Encryption for Federated Learning (CP-ABHE-FL) framework, which embeds Linear Secret Sharing Scheme (LSSS)-based access policies into lattice-encrypted gradients, enabling policy-governed homomorphic aggregation without client interaction. • Establishes a mapping between Ciphertext-Policy Attribute-Based Encryption (CP-ABE) structures and lattice-based additive homomorphism, supporting expressive access policies including OR, AND, and threshold gates with non-interactive decryption independent of federation size. • Provides security guarantees, including indistinguishability under chosen-plaintext attack (IND-CPA), collusion resistance, and gradient integrity under the decisional ring learning with errors (DRLWE) assumption, while incorporating Gaussian differential privacy. • Achieves constant per-round communication overhead with respect to the number of clients, addressing the linear scalability limitations inherent in multi-key homomorphic encryption baselines.
Journal
IF:
3.7
Papers:
1.9K
Citations:
4.9K

