A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
[chapter]
2016
Lecture Notes in Computer Science
We present the Balloon password-hashing algorithm. This is the first practical cryptographic hash function that: (i) has proven memory-hardness properties in the random-oracle model, (ii) uses a password-independent access pattern, and (iii) meets or exceeds the performance of the best heuristically secure password-hashing algorithms. Memory-hard functions require a large amount of working space to evaluate efficiently and, when used for password hashing, they dramatically increase the cost of
doi:10.1007/978-3-662-53887-6_8
fatcat:suv2aimhkvcelggdqh45jmgfie