My current research focuses on making secure computation a useful tool for everyday applications. Current focus is to reduce two major barriers in its widespread adoption: inefficiency and usage difficulty. To improve efficiency, we have developed brand new constructions for data structures more suited towards such circuit-driven computation. To reduce usage difficulty, we are now working on a lightweight compiler that lets developers seamlessly embed these new computation protocols into conventional applications. Project page: www.MightBeEvil.org
- Samee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón, Jack Doerner, David Evans, Jonathan Katz. Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation. 37th IEEE Symposium on Security and Privacy (Oakland), San Jose, May 23–25, 2016.
- Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur. Geppetto: Versatile Verifiable Computation. 36th IEEE Symposium on Security and Privacy (Oakland), San Jose, May 17–20, 2015.
- Samee Zahur, Mike Rosulek, and David Evans. Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates. 34th Annual Eurocrypt Conference, Sofia, Bulgaria, April 26–30, 2015.
Other Academic Activity Highlights
- Course co-instructor: . Co-instructed with David Evans. Fall, 2015.
- Class Lecture: . Design and Analysis of Programming Languages (CS 6610, graduate course). An introduction to type systems, and what issues popular languages face when designed without a formal approach. Course instructor: Westley Weimer. Oct 29, 2014.
- Talk: Workshop on Applied Multi-Party Computation. Microsoft Research, Redmond, Feb 20–21, 2014. .
- Talk: University of Maryland, College Park, Maryland. July 25, 2013. .
- Class lecture: Introduction to Engineering (ENGR 1620). An overview for first year undergraduates. Course instructor: Dominick Montie. Sept. 4, 2012.
- Project: GCParser. Worked with William Melicher to design an intermediate language to express boolean logic circuits. It is meant to be a simple, “assembly-like” language that is easy to parse and easy to generate automatically. This can then be executed with an interpreter as a garbled circuits protocol
- Poster: Samee Zahur, Yan Huang, David Evans. Exploiting Public Inputs to Optimize Circuits Used in Secure Computation Protocols. 20th USENIX Security Symposium, San Francisco, August 8–12, 2011.