Friday, November 6, 2015 - 10:30am to 12:00pm

Location:

Hewlett G882

Speaker:

Alessandra Scafuro, BU and Northeastern

In this work we provide a framework that allows us to lightly modify Yao’s garbling scheme and prove adaptive security under various parameter regimes. In particular, we can get a scheme based on one-way functions where the size of the garbled input is only proportional to the width of the circuit (which corresponds to the space complexity of the computation) rather that the entire size of the circuit. More broadly, we develop a connection between constructing adaptively secure schemes in our framework and a certain type of pebble complexity.

Joint work with Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Daniel Wichs.