Please use this identifier to cite or link to this item: http://hdl.handle.net/10609/148192
|Non-linear operations and verifiable decryption in BGV
|Bernabé Rodríguez, Julen
Isern-Deya, Andreu Pere
|Fully Homomorphic Encryption (FHE) schemes are cryptosystems that allow to compute over encrypted messages. Due to the inherent difficulty of training models using private data, this special property is closely watched. One of the most celebrated FHE schemes is BGV, which allows to compute arithmetic operations over encrypted integers. Non-linear operations, though, need more work to be computed. In this work, several techniques to perform non-linear operations such as comparisons on BGV are introduced. An implementation of these techniques in the OpenFHE open-source library is given too. Finally, an introduction to the verifiable decryption problem is introduced. Due to the very nature of FHE, the scientist only gets the encrypted results, and therefore has to ask the data owner to decrypt it. Verifiable decryption protocols are born precisely to ensure that this data decryption is done correctly. In this work, the verifiable decryption protocols for the BGV scheme in  and  are analyzed and the latter is implemented for OpenFHE.
|fully homomorphic encryption
|Appears in Collections:
|Trabajos finales de carrera, trabajos de investigación, etc.
Files in This Item:
|Report of TFM