1177540281
gd_crescenzo.gif
Perfect Security for Password Protocols in the Bounded Retrieval Model

<b>Speaker: Giovanni Di Crescenzo, Telcordia</b><br><br>

<b>Time and Place: Friday 5/4 at 11am, LC102</b><br><br>

<b>Presentation abstract</b>:
Despite their popularity and wide applicability, password protocols remain
subject to a number of weaknesses. In this talk we introduce a formal model
based on reasonable limitations on an adversary's power, under which we
can design password protocols that are provably secure against simultaneous
intrusions and dictionary attacks. While we do not modify the user's algorithm
in the password protocol, we substantially update the server's verification
algorithm by using various types of extractors. Our formal model, called the
Bounded Retrieval Model, is also of interest for the design and analysis of
cryptographic protocols that remain secure against intruders.
<a href="/news/giovanni_di_crescenzo.html">bio</a>