SCN 2012 will have two invited speakers:
|Yuval Ishai (Technion, Israel)
Title:The Complexity of Cryptography
Abstract:How efficient can cryptography be? I will discuss 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.
|Giuseppe Persiano (Università di Salerno, Italy)
Title:Functional Encryption: Games and Simulation
Abstract:Since the early days of Cryptography, it has been clear that one can formalize security properties in one of two ways: by using a simulator or by using a game. For standard public key encryption the two notions coincide but this does not hold for functional encryption, a more sophisticated type of encryption with several potential applications. In this talk I will survey ongoing work on simulation-based functional encryption, on how to define it, and on how to construct it.