Clemson University
Leveled Homomorphic Encryption Schemes: Noise and Precision Control
Abstract
dc:description.abstractHomomorphic encryption allows for computations on encrypted data without exposing the underlying plaintext, enabling secure and private data processing in various applications such as cloud computing and machine learning. In this thesis, we conduct a comprehensive worst-case noise analysis for three prominent leveled homomorphic encryption schemes: Brakerski-Gentry-Vaikuntanathan (BGV), Brakerski-Fan-Vercauteren (BFV), and Cheon-Kim-Kim-Song (CKKS). We propose modifications to these schemes and their residue number system (RNS) variants, ensuring fresh encryption noise falls under a constant bound. For BFV and BGV, we design and prove parameter conditions which guarantee certain homomorphic circuit evaluations return ciphertexts containing noise within a fixed bound. For CKKS, we design and prove parameter conditions which guarantee some amount of precision accuracy. We consider all these designs and analyses with both original and RNS variants of the schemes. We also conduct our own security analysis and recommendations for parameters with guaranteed homomorphic computation and precision accuracy.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy (PhD)
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yates, Kyle
- Contributors dc:contributor
-
- Shuhong Gao
- Ryann Cartor
- Felice Manganiello
- Hui Xue
Subjects
dc:subject × 3Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_dissertations/4174