<HEAD><TITLE> Abstract/Bio </TITLE> </HEAD> <BODY>
<CENTER><H3>Stanford EE Computer Systems Colloquium<BR></H3></CENTER>
<CENTER><H5>4:15PM, Wednesday, May 13, 2015<br>
HP Auditorium, Gates Computer Science Building Room B1 <br>
Stanford University<br>
<A HREF=http://ee380.stanford.edu>http://ee380.stanford.edu</A>
</H5></CENTER>
<P>
<H4 ><CENTER>
How not to generate random numbers
</CENTER>
</H4>
<P>
<H5>
<CENTER>
Nadia Heninger
<br>
University of Pennsylvania
</CENTER>
</H5>
<B>About the talk:
</B>
<P>
Randomness is essential to cryptography: cryptographic
security depends on private keys that are unpredictable to an
attacker. But how good are the random number generators that are
actually used in practice? In this talk, I will discuss several
large-scale surveys of cryptographic deployments, including TLS, SSH,
Bitcoin, and secure smart cards, and show that random number
generation flaws are surprisingly widespread. We will see how many of
the most commonly used public key encryption and signature schemes can
fail catastrophically if used with faulty random number generators,
and trace many of the the random number generation flaws we
encountered to specific implementations and vulnerable implementation
patterns.
<p>
<B>Slides:
</B>
<P>
No slides are available at this time.
<p>
<b>Videos:
</b><p>
<ul>
<li>
<A HREF="http://coursematerials.stanford.edu/live/ee380.asx">
Join the live presentation.</a> Wednesday May 13, 4:15-5:30.
Requires Microsoft Windows Media player.
</li>
<li>
<A HREF="https://mvideos.stanford.edu/graduate#/SeminarDetail/Spring/2015/EE/380">
View video by lecture sequence.
</a>
Spring 2015 series only, HTML5. Available after 8PM on the days of the lecture.
</li>
<li>
<!--
<a href=" target="_blank">
View Video</a>
YouTube.
-->
View video on YouTube. Link available here approximately 48 hours
following the presentation.
</li>
</ul>
<P>
<B>About the speaker:
</B>
<P>
<table>
<tr>
<td>
<img src="http://ee380.stanford.edu/Abstracts/150513-speakerphoto.jpg"
width="175" alt="[speaker photo]">
</td>
<td>
Nadia Heninger is an assistant professor in the Computer and
Information Science department at the University of Pennsylvania. Her
research focuses on security, applied cryptography, and algorithms.
She is best known for her work identifying widespread entropy problems
in cryptographic keys on the Internet (2012 Usenix Security best paper
award), and developing the "cold boot" attack against disk encryption
systems (2008 Usenix Security best student paper award). Previously,
she was an NSF Mathematical Sciences Postdoctoral Fellow at UC San
Diego and a visiting researcher at Microsoft Research New England.
She received her Ph.D. in computer science in 2011 from Princeton and
a B.S. in electrical engineering and computer science in 2004 from UC
Berkeley.
</td>
</tr>
</table>
<P>
<B>Contact information:</B><P>
Nadia Heninger<br>
Computer and Information Science<br>
University of Pennsylvania
<P>
<b>ABOUT THE COLLOQUIUM:</b><p>
See the Colloquium website, <a href="http://ee380.stanford.edu">
http://ee380.stanford.edu</a>, for scheduled
speakers, FAQ, and additional information. Stanford and SCPD students
can enroll in EE380 for one unit of credit. Anyone is welcome to attend;
talks are webcast live and archived for on-demand viewing over the web.
<p>
<b>MAILING LIST INFORMATION:</b><p>
This announcement is sent to multiple mailing lists. If you are signed
up on our private EE380 list you can remove yourself using the widget
at the upper left hand corner of the Colloquium web page. Other lists
have other management protocols.
<p>
</BODY>
</HTML>