Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
From MaRDI portal
Publication:2958121
DOI10.1007/978-3-662-53887-6_8zbMath1404.94043OpenAlexW2552182158MaRDI QIDQ2958121
Stuart Schechter, Dan Boneh, Henry Corrigan-Gibbs
Publication date: 1 February 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53887-6_8
scrypttime-space trade-offsArgon2password hashingmemory-hard functionspebbling argumentssandwich graph
Related Items (7)
Proof of Space from Stacked Expanders ⋮ Towards quantum large-scale password guessing on real-world distributions ⋮ Rifflescrambler -- a memory-hard password storing function ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Cost-asymmetric memory hard password hashing ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ Cost-asymmetric memory hard password hashing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time-space trade-offs in a pebble game
- Efficient cache attacks on AES, and countermeasures
- Tradeoff Cryptanalysis of Memory-Hard Functions
- Efficiently Computing Data-Independent Memory-Hard Functions
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation
- BLAKE2: Simpler, Smaller, Fast as MD5
- Formalizing Human Ignorance
- Multi-instance Security and Its Application to Password-Based Cryptography
- Proofs of Space: When Space Is of the Essence
- Memory-Demanding Password Scrambling
- High Parallel Complexity Graphs and Memory-Hard Functions
- Resource-based corruptions and the combinatorics of hidden diversity
- One-Time Computable Self-erasing Functions
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
- Proof of Space from Stacked Expanders
- Proofs of Space
- Time/Space Trade-Offs for Reversible Computation
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Complete Register Allocation Problems
- On Time Versus Space
- Space bounds for a game on graphs
- A Time-Space Trade-Off
- Software protection and simulation on oblivious RAMs
- Keccak
- Depth-Robust Graphs and Their Cumulative Memory Complexity
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Advances in Cryptology - CRYPTO 2003
- Pebbling and Proofs of Work
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
- Mitigating Dictionary Attacks on Password-Protected Local Storage
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2006
This page was built for publication: Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
