In 2019, Antoine Joux proposed a FHE based on Fermat numbers, with an aim to express all cryptographic functions in simple operations on the ciphertext components and their binary decompositions. We use recent results on sub-Gaussian variables to find better bounds on the errors in the cryptosystem leading to smaller parameters. We also adapt the concept of k-bit encryption and functional bootstrapping proposed by Gao to the FHE. With this variant, we can extract the XOR and AND gates (and all other basic gates) in a single bit extraction. For larger values of k, we also discuss possibilities of evaluating commonly used activation functions in neural networks using this mechanism.
Le séminaire aura lieu en ligne via la plateforme Zoom :
Veuillez contacter les organisateurs pour avoir le code de la réunion.