The research paper Fully Homomorphic Encryption over the Integers by van Dijk,
Gentry, Halevi, and Vaikuntanathan [31] explores the construction of an encryption
scheme over the integers that is fully homomorphic, using modular arithmetic. The
plaintext messages in this encryption are single bits and the ciphertexts are large
integers. The homomorphic property means that the algebraic operations on the
plaintexts can be carried out analogously on the ciphertexts. We analyze in detail
the parameter constraints required to make the scheme functional and secure, prove auxiliary results about noise accumulation, and generate a toy example to concretely illustrate parts of the scheme.
| Identifer | oai:union.ndltd.org:uottawa.ca/oai:ruor.uottawa.ca:10393/35977 |
| Date | January 2017 |
| Creators | Pabstel, Melanie Anne |
| Contributors | Nevins, Monica |
| Publisher | Université d'Ottawa / University of Ottawa |
| Source Sets | Université d’Ottawa |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.002 seconds