arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.22037cs.CR
收藏

对阈值同态加密在隐私平均聚合中的应用的深入审视

A Critical Look into Threshold Homomorphic Encryption for Private Average Aggregation

atlanTTic, Universidade de Vigo(维戈大学)

Miguel Morona-Mínguez, Alberto Pedrouzo-Ulloa, Fernando Pérez-González

AI总结:

本文研究了阈值同态加密在隐私联邦平均聚合中的应用,分析了使用模糊噪声作为对策对性能的影响,并比较了 BFV 和 CKKS 的性能。

摘要:

阈值同态加密(阈值HE)是实现隐私联邦平均聚合的理想选择,这是联邦学习(FL)中的关键操作。尽管其潜力巨大,但近期研究显示,主流HE库中可用的阈值方案如果攻击者能够访问受限解密 oracle,则可能引入意外的安全漏洞。该 oracle 反映了 FL 客户端协同解密聚合结果的能力,而无需知道秘密钥。本文调查了阈值 RLWE 基础的 HE 在联邦平均聚合中的应用,并检查了使用方差较大的模糊噪声作为对策对性能的影响。我们提供了阈值 BFV 和 CKKS 变体的详细比较,发现 CKKS 基础的聚合性能与 BFV 基础的解决方案相当。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑