CS 234 Final Project

Parker Newton

Project Updates

• 02/14/2019: I will work on the problem of implementing a cryptographic protocol that allows for the secure homomorphic evaluation of string matching. The application of this project to bioinformatics is the problem of one party determining if the genome held by another party matches a certain pattern such that the party holding the regular expression shouldn't learn the genome sequence and the party holding the genome sequence shouldn't learn the regular expression. This project will proceed in two parts: First, we must transform a regular expression into an NFA. Second, we implement a fully homomorphic symmetric key encryption scheme to encrypt the transition matrices of the NFA.
• 03/15/2019: Finished implementation and testing of the project. Prepared a demo to present to the instructor during finals week.