Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/13196
Title: | A Proof of Concept for Homomorphically Evaluating an Encrypted Assembly Language |
Authors: | Rakas, Dragan |
Advisor: | Soltys, Michael |
Department: | Computer Science |
Keywords: | homomorphic encryption;assembly language;implementation;proof of concept;circuit evaluation;simulating circuits |
Publication Date: | Oct-2013 |
Abstract: | <p>Fully homomorphic encryption allows computations to be made on encrypted data without decryption, while preserving data integrity. This feature is desirable in a variety of applications such as banking, search engine and database querying, and some cloud computing services. Despite not knowing the plaintext content of the data, a remote server performing the computation would still be aware of the functions being applied to the data. To address the issue, this thesis proposes a method of encrypting circuits and executing encrypted instructions, by combining fully homomorphic encryption and digital logic theory. We use the classic RISC Archtecture as a foundation of our work, and the result of our algorithm is essentially an encrypted programming language, where a remote server is capable of executing program code that was written and encrypted by a local client.</p> |
URI: | http://hdl.handle.net/11375/13196 |
Identifier: | opendissertations/8017 8942 4233503 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 690.62 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.