Contributions to fully homomorphic encryption
In recent years, the field of Fully Homomorphic Encryption (FHE) has become one of the main pilars for privacy-preserving technologies. However, many challenges still remain to be tackled before this technology can be widely adopted in practice. In this thesis, we address some of these important cha...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis doctoral |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | CBUC, CESCA |
| Repositorio: | TDR. Tesis Doctorales en Red |
| OAI Identifier: | oai:www.tdx.cat:10803/691849 |
| Acceso en línea: | http://hdl.handle.net/10803/691849 |
| Access Level: | acceso abierto |
| Palabra clave: | Fully homomorphic encryption Post-quantum cryptography CKKS TFHE Image compression Private set union 62 |
| Sumario: | In recent years, the field of Fully Homomorphic Encryption (FHE) has become one of the main pilars for privacy-preserving technologies. However, many challenges still remain to be tackled before this technology can be widely adopted in practice. In this thesis, we address some of these important challenges. More specifically, we provide a fast and flexible methodology to select parameters for any lattice-based FHE scheme. We provide the first multi-party extension for TFHE, a state-of-the-art FHE scheme. Our extension to the multi-party setting enables the use of TFHE to a wide range of scenarios. In this thesis we provide two new applications of FHE. In particular, we design the first approximate FHE-based protocol to solve Private Set Union and provide a methodology to compute any function over the union with minimal overhead. Finally, we design the first image encoding and processing scheme which can work over the FHE domain. |
|---|