|Nov 2013||Applications of Indistinguishability Obfuscation
Stanford Security Lunch
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
Qualifying Exam Talk
|Nov 2012||The Rank Method and Applications to Quantum Lower Bounds
Stanford Theory Lunch
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