Abstract
The Cross Domain Problem (CDP) strives to ensure protected data transference across varying security domains. In order to accomplish this, a Cross Domain Solution (CDS) is needed. A common method to protect data is to focus on risk management between trusted parties; however, untrusted parties pose ongoing concern. The problem is determining a method that transfers classified data through various security domains without exposing any information to intermediary parties. Attempts to mitigate this problem have been made utilizing Homomorphic Encryption (HE), a type of encryption that allows for computations to be executed on encrypted data without needing to decrypt it. Research studies have demonstrated the feasibility of applying an HE scheme paired with a cipher to successfully create a CDS for untrusted parties. By researching recent enhancements in the fields of homomorphic encryption, lightweight ciphers, and hybrid homomorphic ciphers a pair was found with the hope of practical main steam use has been achieved. The homomorphic scheme, BFV, has been around for many years with thorough testing and new optimizations applied. The cipher, Pasta, is a hybrid homomorphic cipher specifically catered to the application of homomorphic decryption. Together, a software test case was created that would mimic the required behavior needed to create a CDS. The final implementation offered testing of homomorphic decryption with both 3-Round and 4- Round Pasta with acceptable speeds given the processing power available. Along with the rounds changing, size of key, plaintext, and multiplicative depth influenced overall performance. Verifying the usability post decryption, comparison of values at any index demonstrated the ability to search and compare specific plaintext or metadata values for viable information about transmission through encountered gateways. In both variations, the speed was favorable, proving to be at least 5 times faster than similar implementations.
Library of Congress Subject Headings
Data encryption (Computer science); Homomorphisms (Mathematics)
Publication Date
7-2023
Document Type
Thesis
Student Type
Graduate
Degree Name
Computer Engineering (MS)
Department, Program, or Center
Computer Engineering (KGCOE)
Advisor
Marcin Lukowiak
Advisor/Committee Member
Stanislaw Radziszowski
Advisor/Committee Member
Sonia Lopez Alarcon
Recommended Citation
Dailey, Cheyenne, "Applying Homomorphic Encryption to a Cross Domain Problem" (2023). Thesis. Rochester Institute of Technology. Accessed from
https://repository.rit.edu/theses/11538
Campus
RIT – Main Campus
Plan Codes
CMPE-MS