I'm a research scientist at Facebook. In 2016, I graduated with a PhD in computer science at Stanford University. My PhD focus was in cryptography and security, advised by Dan Boneh.
Most of my recent research has been on the constructions of this new, exciting cryptographic primitive called "order-revealing encryption", and also more generally, multi-input functional encryption. Learn more about our ORE research efforts here.
I have also implemented a few of my research projects that have produced cryptographic primitives. These are all released on GitHub under an open source license.
We initiate a systematic study of mmap-based constructions, building a general framework, called 5Gen, to experiment with program obfuscation and multi-input functional encryption.
We give new constructions of order-revealing encryption with improved security guarantees and also show how to perform range queries efficiently in a manner that is robust against inference attacks.
Joint work with David J. Wu.
We show how to construct pseudorandom functions that are secure against a large class of related-key attacks.
Joint work with Hart Montgomery and Ananth Raghunathan.
We connect natural subgraph finding problems on edge-weighted graphs with the infamous k-Sum Conjecture, establishing tight reductions between graph problems and decision problems on sums.
Joint work with Amir Abboud.
We analyze the online version of the min-cost metric matching problem on k servers and k requests, and show how a simple randomized algorithm obtains an O(log k)-competitive solution on the line metric.
Joint work with Anupam Gupta.
A framework for applications of multilinear maps, including obfuscation and multi-input functional encryption.
A practical implementation of order-revealing encryption, as described by our publication here.
An implementation of function-hiding inner product encryption.