Computer Science Colloquium
Time+Place : Thursday 22/12/2011 10:30 room 337-8 Taub  Bld.
Speaker    : Guy Rothblum  NOTE UNUSUAL TIME 
Affiliation: Microsoft Research
Host       : Yuval Ishai
Title      : How to Compute in the Presence of Leakage
Abstract   :
We address the following problem: how to execute any algorithm, for an
unbounded number of executions, in the presence of an attacker who gets to
observe partial information on the internal state of the computation during
This general problem has been  addressed in the last few years with varying
degrees of success. It is important for running cryptographic algorithms in
the presence of side-channel attacks, as well as for running
non-cryptographic algorithms, such as a proprietary search algorithm or a
game, on a cloud server where parts of the execution's internals might be
In this work, we view algorithms as running on a leaky CPU. In each
(sub)-computation run on the CPU, we allow the adversary to observe the
output of an arbitrary and adaptively chosen length-bounded function on the
CPU's input, output, and randomness.
Our main result is a general compiler for transforming any algorithm into
one that is secure in the presence of this family of partial observation
attacks (while maintaining the algorithm's functionality).
This result is unconditional, it does not rely on any secure hardware
components or cryptographic assumptions.
Joint work with Shafi Goldwasser.
Short bio:
Guy Rothblum recently joined Microsoft Research, Silicon Valley as a
researcher. Previously, he obtained his Ph.D. from MIT, where his advisor
was Shafi Goldwasser. His research focuses on privacy-preserving data
analysis, cryptography, and complexity theory.
Visit our home page-   <>
Technion Math. Net (TECHMATH)
Editor: Michael Cwikel   <> 
Announcement from: Hadas Heier   <>