Balloon Hashing - A Memory Hard Function Providing Provable Protection Against Sequential Attacks

Balloon Hashing - A Memory Hard Function Providing Provable Protection Against Sequential Attacks

Explore a cryptographic talk from Asiacrypt 2016 that introduces Balloon Hashing, a memory-hard function designed to provide provable protection against sequential attacks. Delve into the innovative work presented by Dan Boneh, Henry Corrigan-Gibbs, and Stuart E. Schechter as they discuss this novel hashing technique and its implications for cryptographic security.