Back to search

McMaster University

A Proof of Concept for Homomorphically Evaluating an Encrypted Assembly Language

Abstract

dc:description.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>

Degree

thesis:*
Department dc:contributor.department
Computer Science
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rakas, Dragan
Advisor dc:contributor.advisor
  • Soltys, Michael

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/8017
8942
4233503

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Rakas, Dragan. A Proof of Concept for Homomorphically Evaluating an Encrypted Assembly Language. 2013. http://hdl.handle.net/11375/13196