Pith. sign in

REVIEW 3 cited by

FLASHE: Additively Symmetric Homomorphic Encryption for Cross-Silo Federated Learning

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 2109.00675 v2 pith:NQVTI6KU submitted 2021-09-02 cs.CR cs.DCcs.LG

classification cs.CRcs.DCcs.LG
keywords flashecross-silocommunicationencryptionoverheadtrainingcomputationfederated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Homomorphic encryption (HE) is a promising privacy-preserving technique for cross-silo federated learning (FL), where organizations perform collaborative model training on decentralized data. Despite the strong privacy guarantee, general HE schemes result in significant computation and communication overhead. Prior works employ batch encryption to address this problem, but it is still suboptimal in mitigating communication overhead and is incompatible with sparsification techniques. In this paper, we propose FLASHE, an HE scheme tailored for cross-silo FL. To capture the minimum requirements of security and functionality, FLASHE drops the asymmetric-key design and only involves modular addition operations with random numbers. Depending on whether to accommodate sparsification techniques, FLASHE is optimized in computation efficiency with different approaches. We have implemented FLASHE as a pluggable module atop FATE, an industrial platform for cross-silo FL. Compared to plaintext training, FLASHE slightly increases the training time by $\leq6\%$, with no communication overhead.

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. SenseCrypt: Sensitivity-guided Selective Homomorphic Encryption for Joint Federated Learning in Cross-Device Scenarios

    cs.CR 2025-08 conditional novelty 6.0 of 10

    SenseCrypt clusters federated learning clients by data distribution using model parameter sensitivity, then assigns each client a straggler-free encryption budget and solves a knapsack-style mask selection to balance ...

  2. Information-Theoretically Secure Aggregation for Lightweight Federated Learning: Resilient to Dropouts and Adversaries

    cs.LG 2026-07 reject novelty 5.0 of 10

    A secure aggregation protocol for sign-based federated learning computes the majority vote in one round with linear offline cost, but the claimed degree-halving simplification breaks at zero inputs and for inverse terms.

  3. Hi-SAFE: Hierarchical Secure Aggregation for Lightweight Federated Learning

    cs.LG 2025-11 conditional novelty 5.0 of 10

    Hi-SAFE privately computes the signSGD majority vote using a Fermat-based indicator polynomial evaluated with Beaver triples, and uses subgrouping to keep per-user cost independent of n.

Pith tools