|May 2015||Cryptography in the Age of Quantum Computers
It is well established that full-fledged quantum computers, when realized, will completely break many of today`s
cryptosystems. This looming threat has led to the proposal of so-called "post-quantum" systems, namely those that
appear resistant to quantum attacks. We argue, however, that the attacks considered in prior works model only the
near future, where the attacker may be equipped with a quantum computer, but the end-users implementing the protocols
are still running classical devices.
|Apr 2015||The Surprising Power of Modern Cryptography
Modern cryptography is surprisingly powerful, yielding capabilities such as secure multiparty computation, computing
on encrypted data, and hiding secrets in code. Currently, however, some of these advanced abilities are still too
inefficient for practical use. The goals of my research are two-fold: (1) continue expanding the capabilities of
cryptography and its applications, and (2) bring these advanced capabilities closer to practice.
|Nov 2013||Applications of Indistinguishability Obfuscation
In a flurry of recent works, a form of program obfuscation called indistinguishability obfuscation (iO) has proven to be an incredibly useful cryptographic tool. In this talk, I will cover our recent work that uses iO to build multiparty key exchange, broadcast encryption, and traitor tracing. Our schemes have several novel features; for example, our key exchange and broadcast schemes can be instantiated with user's existing RSA keys.
|Sep 2013||Multilinear Maps and Their Applications
|Nov 2012||The Rank Method and Applications to Quantum Lower Bounds
In the oracle interrogation problem, we are allowed to make q queries to an unknown oracle H, and attempt to produce k input/output pairs of H. If only classical queries are allowed, then this problem is trivial when q is at most k, but impossible otherwise. Once we allow queries on a quantum superposition of inputs, however, little was previously known. In our recent paper, we introduce a new quantum lower bound technique, called the Rank Method, and use it to prove exact lower bounds for the oracle interrogation problem in the quantum world. In this talk, I will give the intuition behind the Rank Method and some applications.
|Jul 2012||Association for Computing Machinery