ACE Seminar: Candidate Indistinguishability Obfuscation and Applications

Speaker: Mariana Raykova

Date/Time: 14-May-2015, 14:00 UTC

Venue:

Details

Abstract

In this talk I will present the first candidate construction for indistinguishability obfuscation for all polynomials size circuits. This will include the blueprint construction for obfuscation of NC1 and the bootstrapping technique from obfuscation of NC1 to obfuscation of P/poly. I will cover also some more recent developments in the area. I will discuss several applications of obfuscation including functional encryption for all circuits, multi-input functional encryption and order-revealing encryption. Further I will present the first construction for order-revealing encryption that provides the “best possible” semantic security, which is inspired by obfuscation techniques, but does not use obfuscation directly.

Bio

Mariana Raykova is a research scientist at SRI International. She received her PhD from Columbia University in 2012 advised by Steven Bellovin and Tal Malkin. After that she spent a year as a postdoc in the cryptography group at IBM Watson Research Center. Her work includes research in secure computation, secure search, verifiable outsourced computation, and software obfuscation. She received Best Paper award at the IEEE Symposium on Security and Privacy in 2013 for her work on the system for verifiable computation Pinocchio. She is author of the first work constructing cryptographic software obfuscation for any program. 

 

 

This page was last modified on 27 Mar 2014.