Henry Corrigan-Gibbs
March 11, 2016 at 12:00 PM in 380 Soda Hall
Title:Space-Hard Functions for Password Hashing
Abstract: In this talk, I will introduce the problem of password hashing and will explain the reasons to prefer space-hard password hashing functions over conventional cryptographic hashes. Next, I will present the design and analysis of the Balloon hash functions, a new family of space-hard hash functions that: * require a certain amount working space to compute efficiently, * avoid certain important side-channel attacks, and * are fast enough for real-world use. Finally, I will discuss recent related work on password hashing and will highlight a few key open problems. Joint work with: Dan Boneh and Stuart Schechter
Bio: Henry Corrigan-Gibbs is a PhD student at Stanford, where he studies applied cryptography and computer security. Much of Henry's research focuses on using cryptographic tools to solve practical problems. His recent work includes Riposte, a system for anonymous messaging at million-user scale, and Stickler, a system for defending website owners from malicious content distribution networks.