arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.13696cs.CRcs.AR
收藏

FPT:用于环面全同态加密的定点加速器

FPT: a Fixed-Point Accelerator for Torus Fully Homomorphic Encryption

Michiel Van Beirendonck, Jan-Pieter D'Anvers, Furkan Turan, Ingrid Verbauwhede

AI总结:

FPT是一种定点FPGA加速器,利用噪声修剪的定点运算实现TFHE自举,达到1 BS/35微秒的吞吐量,比CPU实现快两到三个数量级,比ASIC仿真快2.5倍。

摘要:

全同态加密是一种允许对加密数据进行计算的技术。它有可能改变云中的隐私考量,但计算和内存开销阻碍了其应用。TFHE是一种基于环面的有前景的全同态加密方案,它依赖于自举(bootstrapping),即在每次加密的逻辑/算术运算后调用的噪声去除工具。我们提出了FPT,一种用于TFHE自举的定点FPGA加速器。FPT是第一个利用全同态加密计算中固有噪声的硬件加速器。它不是使用双精度或单精度浮点运算,而是完全使用近似定点运算来实现TFHE自举。通过对自举FFT计算中噪声传播的深入分析,FPT能够使用噪声修剪的定点表示,其大小比先前实现小达50%。FPT被构建为受传统流式DSP启发的流式处理器:它直接级联高吞吐量的计算阶段,具有最少的控制逻辑和路由网络。我们探索了具有用户可配置流宽度的流式内核的吞吐量平衡组合,以构建完整的自举流水线。我们的方法允许算术单元100%的利用率,并且只需要一个小的自举密钥缓存,从而实现完全计算受限的自举吞吐量,即1 BS / 35微秒。这与经典的CPU方法形成鲜明对比,后者通常受内存和带宽限制。FPT作为Alveo U280数据中心加速卡上的自举FPGA内核实现和评估。FPT实现的引导吞吐量比现有基于CPU的实现高两到三个数量级,与最近的ASIC仿真实验相比,吞吐量高出2.5倍。

英文摘要:

Fully Homomorphic Encryption is a technique that allows computation on encrypted data. It has the potential to change privacy considerations in the cloud, but computational and memory overheads are preventing its adoption. TFHE is a promising Torus-based FHE scheme that relies on bootstrapping, the noise-removal tool invoked after each encrypted logical/arithmetical operation. We present FPT, a Fixed-Point FPGA accelerator for TFHE bootstrapping. FPT is the first hardware accelerator to exploit the inherent noise present in FHE calculations. Instead of double or single-precision floating-point arithmetic, it implements TFHE bootstrapping entirely with approximate fixed-point arithmetic. Using an in-depth analysis of noise propagation in bootstrapping FFT computations, FPT is able to use noise-trimmed fixed-point representations that are up to 50% smaller than prior implementations. FPT is built as a streaming processor inspired by traditional streaming DSPs: it instantiates directly cascaded high-throughput computational stages, with minimal control logic and routing networks. We explore throughput-balanced compositions of streaming kernels with a user-configurable streaming width in order to construct a full bootstrapping pipeline. Our approach allows 100% utilization of arithmetic units and requires only a small bootstrapping key cache, enabling an entirely compute-bound bootstrapping throughput of 1 BS / 35us. This is in stark contrast to the classical CPU approach to FHE bootstrapping acceleration, which is typically constrained by memory and bandwidth. FPT is implemented and evaluated as a bootstrapping FPGA kernel for an Alveo U280 datacenter accelerator card. FPT achieves two to three orders of magnitude higher bootstrapping throughput than existing CPU-based implementations, and 2.5x higher throughput compared to recent ASIC emulation experiments.

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

↑