REVIEW 5 cited by
FedML-HE: An Efficient Homomorphic-Encryption-Based Privacy-Preserving Federated Learning System
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
read the original abstract
Federated Learning trains machine learning models on distributed devices by aggregating local model updates instead of local data. However, privacy concerns arise as the aggregated local models on the server may reveal sensitive personal information by inversion attacks. Privacy-preserving methods, such as homomorphic encryption (HE), then become necessary for FL training. Despite HE's privacy advantages, its applications suffer from impractical overheads, especially for foundation models. In this paper, we present FedML-HE, the first practical federated learning system with efficient HE-based secure model aggregation. FedML-HE proposes to selectively encrypt sensitive parameters, significantly reducing both computation and communication overheads during training while providing customizable privacy preservation. Our optimized system demonstrates considerable overhead reduction, particularly for large foundation models (e.g., ~10x reduction for ResNet-50, and up to ~40x reduction for BERT), demonstrating the potential for scalable HE-based FL deployment.
Forward citations
Cited by 5 Pith papers
-
Hollow-LLM Attack: Computationally Trivial Weights in Zero-Knowledge Verification of LLM Inference
ZK-verified LLM inference can be fooled: a provider can serve a small model while producing valid proofs for a much larger declared model by embedding structure-preserving ghost weights.
-
PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learning
Multi-server multi-key FHE with a shared random mask lets PRoVeFL run complex Byzantine-robust FL aggregation privately and verifiably, with large reported speedups over Prio and ELSA.
-
On What We Can Learn from Low-Resolution Data
Low-resolution data improves high-resolution model performance when high-resolution samples are limited, via KL-divergence bounds and experiments on vision transformers and CNNs.
-
A Multiparty Homomorphic Encryption Approach to Confidential Federated Kaplan Meier Survival Analysis
A threshold CKKS-based federated framework for Kaplan-Meier curves that aggregates encrypted per-time-point counts and matches centralized results while blocking reconstruction attacks.
-
Enhancing Model Privacy in Federated Learning with Random Masking and Quantization
FedQSN hides part of the server model with random masks and quantizes the remainder to give clients a degraded proxy, reporting a large global-vs-proxy performance gap with modest loss in the final global model.
Discussion (0). Sign in to comment.