Integer-based fully homomorphic encryption

Show full item record

Title: Integer-based fully homomorphic encryption
Author: Snook, Michael
Abstract: The concept of fully homomorphic encryption has been considered the "holy grail" of cryptography since the discovery of secure public key cryptography in the 1970s. Fully homomorphic encryption allows arbitrary computation on encrypted data to be performed securely. Craig Gentry's new method of bootstrapping introduced in 2009 provides a technique for constructing fully homomorphic cryptosystems. In this paper we explore one such bootstrappable system based on simple integer arithmetic in a manner that someone without a high level of experience in homomorphic encryption can readily understand. Further, we present an implementation of the system as well as a lattice- based attack. We present performance results of our implementation under various parameter choices and the resistance of the system to the lattice-based attack under those parameters. Unfortunately, while the system is very interesting from a theoretical point of view, the results show that it is still not feasible for use.
Record URI: http://hdl.handle.net/1850/14205
Date: 2011-06-17

Files in this item

Files Size Format View Description
MSnookThesis6-17-2011.pdf 352.3Kb PDF View/Open Thesis
MSnook_Code.zip 206.4Kb Unknown View/Open
SnookDefenseSlides.pdf 338.9Kb PDF View/Open Defense Slides

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse