I am a researcher in the Cryptography Research group at MSR Redmond. In 2015 I graduated from UC Berkeley with Ph.D. in mathematics.
My current research interests fall under the umbrella of computing on encrypted data. In particular, I am interested in practical applications of homomorphic encryption and secure multi-party computation (MPC) to machine learning, genomics, and medical data privacy.
I am currently the main developer and administrator of the Simple Encrypted Arithmetic Library.
•Key Recovery for LWE in Polynomial Time (slides). Joint Mathematics Meetings, Special Session on Number Theory and Cryptography, Seattle, WA, January 2016.
•Time-Memory Trade-offs for Index Calculus in Genus 3 (slides). ECC 2015, Bordeaux, France, September 2015.
•Key Recovery for LWE in Polynomial Time. Center for Communications Research, La Jolla, CA, May 2015.
•Learning With Errors in Homomorphic Cryptography (slides). UC Berkeley (Number Theory Seminar), January 2015.
•Key recovery for LWE in polynomial time (slides). DIMACS Workshop on The Mathematics of Post-Quantum Cryptography, Rutgers University, January 2015.
•Attacks and defenses in genus 3 (slides). Center for Communications Research, La Jolla, CA, December 2014.
•Security in genus 3 (slides). UC San Diego (Number Theory Seminar), November 2014.
•Security of genus 3 curves in cryptograph. UC Berkeley (Number Theory Seminar), April 2014.