The topics of the course will revolve around basing cryptography on imperfect randomness. Indeed, in many situations we do not have perfect randomness, and are forced to deal with weaker imperfect random sources. The main question we address is whether it is possible to do Cryptography from imperfect randomness. As we will see, there are many types of imperfect sources, and also many application scenarios which make the answer to this question somewhat different. For example, in some case we have ``local randomness'' and in other we don't, in some cases we must also deal with error-correction (i.e., biometrics) or local computability (i.e., bounded storage model). In yet other cases, randomness extraction is not needed to get good randomness, but only as a convenient tool to argue privacy.

Tentative topics include:



Last modified: January 14, 2006