14th Estonian Winter School in Computer Science (EWSCS)
XIV Eesti Arvutiteaduse Talvekool

Palmse, Estonia, March 1-6, 2009

Rosario Gennaro

IBM T.J. Watson Research Centre
New York, USA

Provable Security and Efficiency in Cryptographic Constructions

Abstract

Some of the classical results in Modern Cryptography are elegant and beautiful constructions of cryptographic tools from basic complexity-theoretic primitives e.g. based on the Goldreich-Levin proof that every one-way function has a hard-core predicate:

The above schemes are examples of black-box constructions a general methodology to build cryptographic primitives. In this class we will review the above classical results, the black-box construction methodology and then show that for such type of constructions the above schemes are optimal in terms of their efficiency.

Course materials

Valid CSS! Valid XHTML 1.0 Strict Last changed March 9, 2009 0:24 EET by local organizers, ewscs09(at)cs.ioc.ee
EWSCS'09 page: http://cs.ioc.ee/ewscs/2009/