The focus of the talk is deterministic public-key encryption schemes. Besides being interesting from
theoretical and historical perspectives, the deterministic encryption primitive has applications to fast and secure search on remote data. We study several new notions of security for deterministic encryption and relations among them. We present several very efficient deterministic encryption schemes that provably satisfy the strongest-possible security definition [in the random oracle model]. We finally provide the constructions that achieve security for many practical settings, without relying
on the idealized random oracle model. The talk is based on joint papers with Mihir Bellare, Serge Fehr and Adam O’Neill. Alexandra Boldyreva is an Assistant Professor in the School of Computer Science at the Georgia Institute of Technology. She received a Ph.D. in Computer Science from the University of California at San Diego in 2004. She is a recipient of the NSF CAREER award. Her research interests are in cryptography and information security.
Date: Speakers: Affiliation: