Hardware Assisted Fully Homomorphic Function Evaluation and Encrypted Search

Hardware Assisted Fully Homomorphic Function Evaluation and Encrypted Search
复制标题

DOI:
10.1109/tc.2017.2686385
复制
发表时间:
2017-09
影响因子:
3.7
通讯作者:
S. Roy;F. Vercauteren;Jo Vliegen;Ingrid Verbauwhede
S. Roy;F. Vercauteren;Jo Vliegen;Ingrid Verbauwhede
中科院分区:
计算机科学2区
文献类型:
--
作者:
S. Roy;F. Vercauteren;Jo Vliegen;Ingrid Verbauwhede

文献摘要

被引文献

相似文献

在本文中,我们提出了一种在特殊模块重新加密盒的帮助下执行任意深度的同态评估的方案。现有的有些同态加密方案只能执行同态运算,直到密文中的噪声达到取决于同态加密方案的参数的临界界限。经典的自举方法还允许任意深度评估,但会对参数的大小产生不利影响,从而使整个设置效率低下。我们描述了重新加密盒的两个不同实例,以协助任意深度的同态评估。重新加密盒通过降低固有噪声来刷新密文,并且可以与参数的任何实例化一起使用,即与引导不同,没有最小大小。为了证明该提案的实用性,我们在 Xilinx Virtex 6 FPGA 板 ML605 上设计了重新加密盒,以支持 FV 某种同态加密方案。重新加密盒刷新一个密文需要0.43毫秒。此外,我们使用这个重新加密盒来提高加密搜索操作的性能。在 40 核 Intel 服务器上,我们可以在大约 20 秒内对 $2^{16}$ 条目的表进行加密搜索。这比没有重新加密盒的实现快大约 20 倍。
In this paper we propose a scheme to perform homomorphic evaluations of arbitrary depth with the assistance of a special module recryption box. Existing somewhat homomorphic encryption schemes can only perform homomorphic operations until the noise in the ciphertexts reaches a critical bound depending on the parameters of the homomorphic encryption scheme. The classical approach of bootstrapping also allows for arbitrary depth evaluations, but has a detrimental impact on the size of the parameters, making the whole setup inefficient. We describe two different instantiations of our recryption box for assisting homomorphic evaluations of arbitrary depth. The recryption box refreshes the ciphertexts by lowering the inherent noise and can be used with any instantiation of the parameters, i.e. there is no minimum size unlike bootstrapping. To demonstrate the practicality of the proposal, we design the recryption box on a Xilinx Virtex 6 FPGA board ML605 to support the FV somewhat homomorphic encryption scheme. The recryption box requires 0.43 ms to refresh one ciphertext. Further, we use this recryption box to boost the performance of encrypted search operation. On a 40 core Intel server, we can perform encrypted search in a table of $2^{16}$ entries in around 20 seconds. This is roughly 20 times faster than the implementation without recryption box.