Jul 2026· 2026 3rd World Conference on Computer and Information Security (WCCIS)· pp. 280-283· 0 citations· 8 references
Abstract
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.
To address privacy leakage in centralized aggregation, this paper proposes FedShare, a multi-server secure aggregation scheme based on additive secret sharing. It adopts a three-layer architecture (clients, ordinary aggregation servers, and a super aggregation server), where client model updates are split into secret s...
Yuchen Jiang· 2026 3rd World Conference on...· 0 citations
A multi-server secure aggregation scheme based on additive secret sharing that achieves information-theoretic privacy protection, effectively breaking the trilemma among privacy, accuracy, and efficiency.
Ming-Yuan Li· Applied and Computational En...· 0 citations
A novel secure aggregation protocol based on two-layer secret sharing based on Shamir's Secret Sharing with 2-out-of-2 additive secret sharing using a Pseudo-Random Function (PRF) is proposed, enabling one-shot secure aggregation with a single server and no intermediary data forwarding.
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, m...
Sahar Ghoflsaz Ghinani, Elaheh Sadredini· International Conference on...· 0 citations
A lightweight anonymous authentication scheme for federated learning (FedLAS), which realizes secure mutual authentication between servers and clients and establishes a shared session key for subsequent encrypted interaction, and eliminates the reliance on high-cost cryptographic operations such as bilinear pairing, th...
Shu Wu, Guoqiang Meng, Lin-Lin Lu et al.· Scientific Reports· 0 citations
It is proved that TriVer satisfies client data privacy, aggregation correctness, and aggregation-result non-forgeability in the Random Oracle Model under ECDLP hardness, HPRF pseudorandomness, and hash collision resistance, against a fully malicious server that may collude with a subset of aggregators and clients.
Guang-Ye Zhu, Liqiang Wu, Wei-Dong Du· Journal of King Saud Univers...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.