Abstract
dc:description.abstractIn 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic encryption schemes with a variety of techniques to include modulus leveling and techniques of error bound control.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- 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 × 8Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_theses/3868