mlsanityData to 7 Oct 2026

A Critical Look into Threshold Homomorphic Encryption for Private Average Aggregation

arXiv 2602.22037 ↗First posted 25 Feb 2026cs.CRcited by 1

Not on the map. Why?

Abstract (arXiv)

Threshold Homomorphic Encryption (Threshold HE) is a good fit for implementing private federated average aggregation, a key operation in Federated Learning (FL). Despite its potential, recent studies have shown that threshold schemes available in mainstream HE libraries can introduce unexpected security vulnerabilities if an adversary has access to a restricted decryption oracle. This oracle reflects the FL clients' capacity to collaboratively decrypt the aggregated result without knowing the secret key. This work surveys the use of threshold RLWE-based HE for federated average aggregation and examines the performance impact of using smudging noise with a large variance as a countermeasure. We provide a detailed comparison of threshold variants of BFV and CKKS, finding that CKKS-based aggregations perform comparably to BFV-based solutions.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 25 Feb 2026.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.