From 2f257b7df972f559a546548b8b4b118100e51ee4 Mon Sep 17 00:00:00 2001 From: Michiel Van Beirendonck Date: Wed, 29 Nov 2023 13:45:56 +0000 Subject: [PATCH] Add CCS citation to readme.md --- readme.md | 43 ++++++++++++++++++++++++++++++++++++++----- 1 file changed, 38 insertions(+), 5 deletions(-) diff --git a/readme.md b/readme.md index 5121e00..e46f9be 100644 --- a/readme.md +++ b/readme.md @@ -4,14 +4,42 @@ FPT accelerates the TFHE bootstrapping operation on FPGA. This repository provides a demo of FPT's performance improvements over an encrypted version of [Conway's Game-of-Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life) implemented with [TFHE-rs](https://github.com/zama-ai/tfhe-rs/). The code in this repo is a fork of TFHE-rs, extending it with the use of FPT and with the demos implemented in `/demo` folder. -The design of FPT will be published at ACM CCS 2023.
-*(Link to the paper and how to cite will be shared when they become available.)* +The design of FPT is published at ACM CCS 2023. Please consider citing our work if you use or build upon the results in this repository. + +
+ACM Ref +
+Michiel Van Beirendonck, Jan-Pieter D'Anvers, Furkan Turan, and Ingrid Verbauwhede. 2023. FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS '23). Association for Computing Machinery, New York, NY, USA, 741–755. https://doi.org/10.1145/3576915.3623159 +
+ +
+BibTex +
+ + - +``` +@inproceedings{10.1145/3576915.3623159, +author = {Van Beirendonck, Michiel and D'Anvers, Jan-Pieter and Turan, Furkan and Verbauwhede, Ingrid}, +title = {FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption}, +year = {2023}, +isbn = {9798400700507}, +publisher = {Association for Computing Machinery}, +address = {New York, NY, USA}, +url = {https://doi-org.kuleuven.e-bronnen.be/10.1145/3576915.3623159}, +doi = {10.1145/3576915.3623159}, +abstract = {Fully Homomorphic Encryption (FHE) is a technique that allows computation on encrypted data. It has the potential to drastically change privacy considerations in the cloud, but high computational and memory overheads are preventing its broad adoption. TFHE is a promising Torus-based FHE scheme that heavily 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 heavily 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 that prefer floating-point or integer FFTs. 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 different throughput-balanced compositions of streaming kernels with a user-configurable streaming width in order to construct a full bootstrapping pipeline. Our proposed approach allows 100\% utilization of arithmetic units and requires only small bootstrapping key cache, enabling an entirely compute-bound bootstrapping throughput of 1 BS / 35us. This is in stark contrast to the established classical CPU approach to FHE bootstrapping acceleration, which is typically constrained by memory and bandwidth. FPT is fully 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.}, +booktitle = {Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security}, +pages = {741–755}, +numpages = {15}, +keywords = {hardware accelerator, fpga, tfhe, fully homomorphic encryption}, +location = {, Copenhagen, Denmark, }, +series = {CCS '23} +} +``` +
## Abstract @@ -38,3 +66,8 @@ In running Game of Life over TFHE, the server receives an encrypted initial boar To run the demo yourself, FPT is made available on [AWS F1 instances](https://aws.amazon.com/ec2/instance-types/f1/). As noted above, this demo version prefers a reduced parameter set to have the software version of the board update the frames in acceptable time. The description of how to run this demo yourself is detailed in [`demos/readme.md`](demos/readme.md). + +--- + +Michiel Van Beirendonck, Jan-Pieter D'Anvers, Furkan Turan, and Ingrid Verbauwhede. 2023. FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS '23). Association for Computing Machinery, New York, NY, USA, 741–755. https://doi.org/10.1145/3576915.3623159 +