CS Seminar: How to Search over Encrypted Data

Speaker: Seny Kamara, Microsoft Research

Wednesday, September 11, 2013 ( 11:00 am to 12:00 pm )

Location: Babbio Center 640 (CyS lab)

Contact: 
swetzel@cs.stevens.edu

Abstract
The problem of searching over encrypted data arises often and, most notably, in the design of secure database systems, file systems, cloud storage systems and in the design of cryptographic protocols. Many solutions to this problem have been proposed in the past, including searchable encryption, deterministic encryption, order preserving encryption, functional encryption, oblivious RAMs, secure two-party computation and fully-homomorphic encryption.
 
In this talk, I will survey the different solutions to the encrypted search problem and discuss their various strengths and limitations, paying particularly close attention to the tradeoffs made between security, efficiency and functionality. I will then present recent advances in the area of searchable encryption and give an overview of the state-of-the art constructions and implementations.
 
 
Bio
Seny Kamara is a researcher in the Crypto Group at Microsoft Research in Redmond. He completed his Ph.D. in Computer Science at Johns Hopkins University under the supervision of Fabian Monrose. At Hopkins he was a member of the Security and Privacy Applied Research (SPAR) Lab. He spent the Fall of 2006 at UCLA's IPAM and the summer of 2003 at CMU's CyLab.
 
His research is primarily in cloud security and cryptography but he maintain interests in various aspects of theory and systems, including applied and theoretical cryptography, information security, technology policy, networking, algorithms and economics.