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

FDFB:面向实用全同态加密的全域函数自举

FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption

Kamil Kluczniak, Leonard Schild

摘要:

所有已知的全同态加密(FHE)方案的密文计算都会引入噪声,如果噪声太大,会破坏明文。因此,重新加密密文并降低噪声水平的自举技术仍然是为任意无界计算构建FHE方案的唯一已知方式。自举步骤也是当前FHE方案中的主要效率瓶颈。一个有前途的方向,以提高具体的效率是利用自举过程执行有用的计算,同时减少噪音。我们展示了一个自举算法,它嵌入了一个查找表,并评估任意函数的明文,同时减少噪声。根据参数的选择,所得到的同态加密方案可以是精确FHE或用于近似算术的同态加密。由于我们可以在明文空间上计算任意函数,因此我们可以使用Regev加密的自然同态来计算仿射函数,而无需几乎免费的自举。因此,我们的算法是特别适合于电路与许多加法和标量乘法门。我们实现了这种电路的创纪录速度。例如,在精确的FHE设置中,我们实现了超过3000倍于最先进方法的加速。实际上,我们将评估时间从数周或数天缩短到几小时或几分钟。此外,我们注意到,随着仿射函数的大小,加速比变得更加显著。我们提供了一个严格的错误分析,并显示了几个参数集,我们的自举。最后,我们实现了我们的算法,并提供了广泛的测试。我们证明了我们的算法,通过评估不同的神经网络在几个参数和精度设置。

英文摘要:

Computation on ciphertexts of all known fully homomorphic encryption (FHE) schemes induces some noise, which, if too large, will destroy the plaintext. Therefore, the bootstrapping technique that re-encrypts a ciphertext and reduces the noise level remains the only known way of building FHE schemes for arbitrary unbounded computations. The bootstrapping step is also the major efficiency bottleneck in current FHE schemes. A promising direction towards improving concrete efficiency is to exploit the bootstrapping process to perform useful computation while reducing the noise at the same time. We show a bootstrapping algorithm, which embeds a lookup table and evaluates arbitrary functions of the plaintext while reducing the noise. Depending on the choice of parameters, the resulting homomorphic encryption scheme may be either an exact FHE or homomorphic encryption for approximate arithmetic. Since we can evaluate arbitrary functions over the plaintext space, we can use the natural homomorphism of Regev encryption to compute affine functions without bootstrapping almost for free. Consequently, our algorithms are particularly suitable for circuits with many additions and scalar multiplication gates. We achieve record speeds for such circuits. For example, in the exact FHE setting, we achieve a speedup of a factor of over 3000x over state-of-the-art methods. Effectively, we bring the evaluation time from weeks or days down to a few hours or minutes. Furthermore, we note that the speedup gets more significant with the size of the affine function. We provide a tight error analysis and show several parameter sets for our bootstrapping. Finally, we implement our algorithm and provide extensive tests. We demonstrate our algorithms by evaluating different neural networks in several parameter and accuracy settings.

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

↑