What have I published?
I've worked on many assorted projects. Here is some work I've done over the years. I start by showcasing my master's project on formal languages, then discuss the deniable file system I worked on. Next, I discuss the cloud storage reconstruction for sharded datastores I worked on at the start of graduate school. Finally, I include my undergraduate thesis on non CMOS computation.
Master's
SELTZER:Solving Efficiency Limitations via Typechecking and Authorizing Enumeration Reckoning

Designed a formal language to improve efficiency for memory trace oblivious programs, a subset of Oblivious RAM. Implemented a modified compiler from this language, which modified ObliVM to be up to 68% faster on deeply nested programs, with predicted exponential improvement on complex pro- grams. Based in Java. Has a comprehensive background on ORAM. You may read it here.
 

Deniable File Systems

Designed a custom block level device driver for Linux that stored an obfuscated file system deniably in free space. Assisted with kernel code written in C. Wrote NSF Grant #1814347 which was used to fund researchers on the project. Mentored the first author from undergraduate to a Ph.D program. Deeply interested in the problem of journalists in conflict zones.
Sharded Data Stores and Cloud Storage Systems

Theoretical method for reconstructing sharded data stores on the cloud efficiently, based on secret sharing. Implementation published later with limited author list.
Undergraduate Thesis
Classified Wolfram Cellular automata for computational abilities based on information theory. Some cellular automata are capable of universal computation. These are known as class 4. I identified class 3 and class 4 cellular automata based on their entropy. From there, I deduced which ones were capable of universal computation according to our metric, and found it held with existing results. Class 4 cellular automata are useful because they occur in nature, and could provide very low energy computational models. Read it and Weep here!