XZDDF Bootstrapping in Fully Homomorphic Encryption
(2024) EITM01 20232Department of Electrical and Information Technology
- Abstract
- Despite the vast research on the topic in recent years, fully homomorphic encryption schemes remain time-inefficient. The main bottleneck is the so-called bootstrapping, whose purpose is to reduce noise that has accumulated after having performed homomorphic operations on a ciphertext. This thesis is about bootstrapping, and how to do it more efficiently. More specifically, a new algorithm, here called XZDDF, is analyzed. The thesis contains a solution to a problem in the original XZDDF algorithm that was encountered during the project. The new algorithm was then implemented in the open-source library OpenFHE. Theoretically, the algorithm has lower time complexity than previous bootstrapping techniques, but the execution time of the... (More)
- Despite the vast research on the topic in recent years, fully homomorphic encryption schemes remain time-inefficient. The main bottleneck is the so-called bootstrapping, whose purpose is to reduce noise that has accumulated after having performed homomorphic operations on a ciphertext. This thesis is about bootstrapping, and how to do it more efficiently. More specifically, a new algorithm, here called XZDDF, is analyzed. The thesis contains a solution to a problem in the original XZDDF algorithm that was encountered during the project. The new algorithm was then implemented in the open-source library OpenFHE. Theoretically, the algorithm has lower time complexity than previous bootstrapping techniques, but the execution time of the implementation was not faster than other algorithms. (Less)
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/student-papers/record/9148114
- author
- Ljungbeck, Simon LU
- supervisor
-
- Qian Guo LU
- organization
- course
- EITM01 20232
- year
- 2024
- type
- H2 - Master's Degree (Two Years)
- subject
- keywords
- Fully Homomorphic Encryption, Homomorphic Encryption, Bootstrapping, Blind Rotation, XZDDF
- report number
- LU/LTH-EIT 2024-964
- language
- English
- id
- 9148114
- date added to LUP
- 2024-02-15 15:12:23
- date last changed
- 2024-02-15 15:12:23
@misc{9148114, abstract = {{Despite the vast research on the topic in recent years, fully homomorphic encryption schemes remain time-inefficient. The main bottleneck is the so-called bootstrapping, whose purpose is to reduce noise that has accumulated after having performed homomorphic operations on a ciphertext. This thesis is about bootstrapping, and how to do it more efficiently. More specifically, a new algorithm, here called XZDDF, is analyzed. The thesis contains a solution to a problem in the original XZDDF algorithm that was encountered during the project. The new algorithm was then implemented in the open-source library OpenFHE. Theoretically, the algorithm has lower time complexity than previous bootstrapping techniques, but the execution time of the implementation was not faster than other algorithms.}}, author = {{Ljungbeck, Simon}}, language = {{eng}}, note = {{Student Paper}}, title = {{XZDDF Bootstrapping in Fully Homomorphic Encryption}}, year = {{2024}}, }