Pith. sign in

REVIEW 3 cited by

FheFL: Fully Homomorphic Encryption Friendly Privacy-Preserving Federated Learning with Byzantine Users

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.05112 v3 pith:EF44QVCH submitted 2023-06-08 cs.AI cs.CR

classification cs.AIcs.CR
keywords encryptiongradientsprivacyschemeserverusersdatahomomorphic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The federated learning (FL) technique was developed to mitigate data privacy issues in the traditional machine learning paradigm. While FL ensures that a user's data always remain with the user, the gradients are shared with the centralized server to build the global model. This results in privacy leakage, where the server can infer private information from the shared gradients. To mitigate this flaw, the next-generation FL architectures proposed encryption and anonymization techniques to protect the model updates from the server. However, this approach creates other challenges, such as malicious users sharing false gradients. Since the gradients are encrypted, the server is unable to identify rogue users. To mitigate both attacks, this paper proposes a novel FL algorithm based on a fully homomorphic encryption (FHE) scheme. We develop a distributed multi-key additive homomorphic encryption scheme that supports model aggregation in FL. We also develop a novel aggregation scheme within the encrypted domain, utilizing users' non-poisoning rates, to effectively address data poisoning attacks while ensuring privacy is preserved by the proposed encryption scheme. Rigorous security, privacy, convergence, and experimental analyses have been provided to show that FheFL is novel, secure, and private, and achieves comparable accuracy at reasonable computational cost.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BlindFL: Segmented Federated Learning with Fully Homomorphic Encryption

    cs.CR 2025-01 conditional novelty 4.0 of 10

    BlindFL randomly selects and encrypts a subset of each client's model layers for aggregation, cutting fully homomorphic encryption overhead in federated learning while preserving accuracy and reducing client-side grad...

  2. Modular Federated Learning: A Meta-Framework Perspective

    cs.LG 2025-05 conditional novelty 3.0 of 10

    A 63-page survey that reframes federated learning as a composition of eight modules and proposes an 'alignment operator' taxonomy, while surveying Python FL frameworks and open challenges.

  3. Federated Learning Architecture: Data Privacy and System Security Approaches

    cs.CR 2026-07 conditional novelty 2.5 of 10

    CKKS plus differential privacy in FedAvg yields usable accuracy on Framingham, Pima, and Bank Marketing, with larger privacy budget growth as clients increase and data shrinks.

Pith tools