PurPL
I'm currently a PhD student working with Prof. Milind Kulkarni as part of the Purdue Programming Languages Group (PurPL). I work on developing optimizing compilers for Fully Homomorphic Encryption.
TL;DR: I'm interested in building compilers specifically to optimize Fully Homomorphic Encryption programs.
Fully Homomorphic Encryption refers to any number of encryption schemes that preserve the ring structure of their plaintext (i.e. if you encrypt two numbers and add or multiply the ciphertexts, you get back an encryption of the sum or product of the original numbers). FHE is a powerful tool for for implementing arbitrary fixed-size arithmetic circuits over encrypted data, but the underlying computational model is very different from the one you're used to. Taking these pecularities into account when compili
PurPL