An overview of Hybrid Homomorphic Encryption by Orel Cosseron and Clément Hoffmann 20.01.2022
Fully Homomorphic Encryption (FHE) has long been considered the crown jewel of cryptology and it is only recently that efficient solutions have started to emerge. Being as it is, the current state of the art of FHE still comes along with a huge expansion factor that implies an overload both in computation time and bandwidth usage.
Hybrid Homomorphic Encryption, or transciphering, aims to solve the latter issue by combining the efficiency of light symmetric schemes with the computational power of FHE. In this talk, we will present an history of HHE, talk about the latest advances in the domain and address the issues that are yet to be solved.
Orel Cosseron & Clément Hoffmann
Can Homomorphic Encryption be Practical?
- Ciphers for MPC and FHE1
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- Stream ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
- Rasta: A cipher with low ANDdepth and few ANDs per bit
- Improved Filter Permutators: Combining Symmetric Encryption Design, Boolean Functions, Low Complexity Cryptography, and Homomorphic Encryption, for Private Delegation of Computations
- Transciphering Framework for Approximate Homomorphic Encryption (Full Version)
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Pasta: A Case for Hybrid Homomorphic Encryption