Proving Correct Execution of TFHE's Bootstrapping using plonky2 w/ Louis Tremblay Thibault

​#Abstract

​In this work we demonstrate for the first time that a full FHE bootstrapping operation can be proven using a SNARK in practice. We do so by designing an arithmetic circuit for the bootstrapping operation and prove it using plonky2.

​We are able to prove the circuit on an AWS Hpc7a instance in under 20 minutes. Proof size is about 200kB and verification takes less than 10ms.

​As the basis of our bootstrapping operation we use TFHE's programmable bootstrapping and modify it in a few places to more efficiently represent it as an arithmetic circuit (while maintaining full functionality and security).

​In order to achieve our results in a memory-efficient way, we take advantage of the structure of the computation and plonky2's ability to efficiently prove its own verification circuit to implement a recursion-based IVC scheme.

​#About the Speaker

Louis Tremblay Thibault is a cryptography researcher at Zama and a PhD student at ÉTS Montréal. His research focuses on privacy-preserving verifiable computation.

​#More Information

Want more information, recordings of the presentations, slides, and other resources from the meetup? Visit this meetup's resource page at https://fhe.org/meetups/081

#Never Miss an Update

The newsletter where we post community announcements: https://fheorg.substack.com/

​The discord server where you can discuss FHE related topics with the community: https://discord.fhe.org

​Make sure to join either (or both) of these to stay informed about future events!