On the Weakness of Fully Homomorphic Encryption
On the Weakness of Fully Homomorphic Encryption
复制标题
DOI：
--
复制
发表时间：
2015-11
期刊：
影响因子：
--
通讯作者：
Zhengjun Cao;Lihua Liu
中科院分区：
文献类型：
--
作者：
Zhengjun Cao;Lihua Liu
全同态加密（FHE）允许任何人对加密数据执行计算，尽管没有秘密解密密钥。自从Gentry在2009年的工作以来，原始的研究引起了许多研究人员的兴趣。在本文中，我们强调，加密数据上执行的任何计算都被约束到加密域（有限域或环）。这种限制使得原语对于涉及常见算术表达式和关系表达式的大多数计算都是无用的。它只适用于与模算术有关的计算。我们想重申，密码学大量使用模运算是为了掩盖和消除明文消息中的冗余，而不是执行任何数值计算。我们认为，FHE对客户端-服务器计算或云计算非常重要的说法可能有些言过其实。
Fully homomorphic encryption (FHE) allows anyone to perform computations on encrypted data, despite not having the secret decryption key. Since the Gentry's work in 2009, the primitive has interested many researchers. In this paper, we stress that any computations performed on encrypted data are constrained to the encrypted domain (finite fields or rings). This restriction makes the primitive useless for most computations involving common arithmetic expressions and relational expressions. It is only applicable to the computations related to modular arithmetic. We want to reaffirm that cryptography uses modular arithmetic a lot in order to obscure and dissipate the redundancies in a plaintext message, not to perform any numerical calculations. We think it might be an overstated claim that FHE is of great importance to client-server computing or cloud computing.