Towards a Functionally Complete and Parameterizable TFHE Processor
Valentin Reyes H\"ausler, Gabriel Ott, Aruna Jayasena, Andreas Peter

TL;DR
This paper presents an FPGA-based TFHE processor that significantly accelerates homomorphic encryption operations, enabling practical secure computation by improving throughput and scalability over existing implementations.
Contribution
It introduces a functionally complete, parameterizable TFHE processor on FPGA with an improved bootstrapping module that greatly enhances performance.
Findings
Achieves 240% to 480% more bootstrappings per second than previous state-of-the-art.
Designs a scalable and efficient FPGA-based architecture for homomorphic encryption.
Lays the groundwork for practical, complete TFHE processors in hardware.
Abstract
Fully homomorphic encryption allows the evaluation of arbitrary functions on encrypted data. It can be leveraged to secure outsourced and multiparty computation. TFHE is a fast torus-based fully homomorphic encryption scheme that allows both linear operations, as well as the evaluation of arbitrary non-linear functions. It currently provides the fastest bootstrapping operation performance of any other FHE scheme. Despite its fast performance, TFHE suffers from a considerably higher computational overhead for the evaluation of homomorphic circuits. Computations in the encrypted domain are orders of magnitude slower than their unencrypted equivalents. This bottleneck hinders the widespread adoption of (T)FHE for the protection of sensitive data. While state-of-the-art implementations focused on accelerating and outsourcing single operations, their scalability and practicality are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
