Time+Place: | Tuesday 22/05/2012 14:30 Room 337-8 Taub Bld. |

Title: | The Complexity of Cryptography |

Speaker: | Yuval Ishai http://www.cs.technion.ac.il/people/yuvali/ |

Affiliation: | Computer Science Dept., Technion |

How efficient can cryptography be? I will discuss some challenges that arise when trying to minimize the amount of computation, communication and interaction in cryptography, and survey recent progress and open questions. Based on joint works with Benny Applebaum, Amos Beimel, Eyal Kushilevitz, Ilan Orlov, Rafail Ostrovsky, and Amit Sahai. Short bio: Yuval Ishai is an Associate Professor of Computer Science at the Technion. He is interested in cryptography and complexity theory. He received his PhD from the Technion, held postdoctoral positions at DIMACS, AT&T Labs Research and Princeton University, and spent an extended sabbatical at UCLA. Refreshments served from 14:15 on, Lecture starts at 14:30