Optimizing fully homomorphic encryption
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/113156 |
| _version_ | 1826190732036145152 |
|---|---|
| author | King, Kevin C |
| author2 | Vinod Vaikuntanathan. |
| author_facet | Vinod Vaikuntanathan. King, Kevin C |
| author_sort | King, Kevin C |
| collection | MIT |
| description | Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016. |
| first_indexed | 2024-09-23T08:44:51Z |
| format | Thesis |
| id | mit-1721.1/113156 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:44:51Z |
| publishDate | 2018 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1131562019-04-10T07:16:06Z Optimizing fully homomorphic encryption King, Kevin C Vinod Vaikuntanathan. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (pages 50-51). Fully homomorphic encryption (FHE) presents the possibility of removing the need to trust cloud providers with plaintext data. We present two new FHE scheme variants of BGV'12, both of which remove the need for key switching after a ciphertext multiplication, overall halving the runtime of bootstrapping. We also present multiple implementations of 32-bit integer addition evaluation, the fastest of which spends 16 seconds computing the addition circuit and 278 seconds bootstrapping. We nd that bootstrapping consumes approximately 90% of the computation time for integer addition and secure parameter settings are currently bottlenecked by the memory size of commodity hardware. by Kevin C. King. M. Eng. 2018-01-12T21:00:28Z 2018-01-12T21:00:28Z 2016 2016 Thesis http://hdl.handle.net/1721.1/113156 1018307316 eng MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 51 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. King, Kevin C Optimizing fully homomorphic encryption |
| title | Optimizing fully homomorphic encryption |
| title_full | Optimizing fully homomorphic encryption |
| title_fullStr | Optimizing fully homomorphic encryption |
| title_full_unstemmed | Optimizing fully homomorphic encryption |
| title_short | Optimizing fully homomorphic encryption |
| title_sort | optimizing fully homomorphic encryption |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/113156 |
| work_keys_str_mv | AT kingkevinc optimizingfullyhomomorphicencryption |