2012.01.24
| Date | Thu Jan 26 |
| Time | 15:00 — 16:00 |
| Location | DI-Ada-333 |
Speaker: John Steinberger, Tsinghua University IIIS
Title: Hellinger distance and adaptivity
Abstract: We will review and introduce the notion of Hellinger
distance, which is a distance measure for probability distributions
that is particularly useful for working with product distributions. We
will show how Hellinger distance can be used to upper bound the
advantage of adaptive distinguishers in certain general settings by
the advantage of non-adaptive distinguishers (loosely speaking). We
will finally show how these ideas apply in a concrete crypto setting,
more precisely for giving provable security results on (abstractions
of) the AES blockcipher. The latter is joint work with Andrey
Bogdanov, Gregor Leander, Lars Knudsen, Francois-Xavier Standaert and
Elmar Tischhauser.