Balloon hashing: a memory-hard function providing provable protection against sequential attacks
From MaRDI portal
Recommendations
- Tradeoff Cryptanalysis of Memory-Hard Functions
- Rifflescrambler -- a memory-hard password storing function
- Static-memory-hard functions, and modeling the cost of space vs. time
- Data-independent memory hard functions: new attacks and stronger constructions
- Depth-robust graphs and their cumulative memory complexity
Cites work
- A Time-Space Trade-Off
- Advances in Cryptology - CRYPTO 2003
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- BLAKE2: simpler, smaller, fast as MD5
- Complete Register Allocation Problems
- Depth-robust graphs and their cumulative memory complexity
- Efficient cache attacks on AES, and countermeasures
- Efficiently computing data-independent memory-hard functions
- Formalizing human ignorance
- High Parallel Complexity Graphs and Memory-Hard Functions
- scientific article; zbMATH DE number 1583806 (Why is no real title available?)
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 3622921 (Why is no real title available?)
- scientific article; zbMATH DE number 1304288 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 1033441 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- Keccak
- Memory-demanding password scrambling
- Mitigating Dictionary Attacks on Password-Protected Local Storage
- Multi-instance security and its application to password-based cryptography
- Non-uniform cracks in the concrete: the power of free precomputation
- On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
- On Time Versus Space
- One-time computable self-erasing functions
- Pebbling and Proofs of Work
- Proof of space from stacked expanders
- Proofs of space
- Proofs of space: when space is of the essence
- Resource-based corruptions and the combinatorics of hidden diversity
- Software protection and simulation on oblivious RAMs
- Space bounds for a game on graphs
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Theory of Cryptography
- Time-space trade-offs in a pebble game
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Time/Space Trade-Offs for Reversible Computation
- Topics in Cryptology – CT-RSA 2006
- Tradeoff Cryptanalysis of Memory-Hard Functions
Cited in
(17)- Bandwidth hard functions for ASIC resistance
- DAHash: distribution aware tuning of password hashing costs
- Towards quantum large-scale password guessing on real-world distributions
- Rifflescrambler -- a memory-hard password storing function
- Memory-demanding password scrambling
- Proof of space from stacked expanders
- Bad directions in cryptographic hash functions
- Rig: a simple, secure and flexible design for password hashing
- 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
- Bandwidth-Hard Functions: Reductions and Lower Bounds
- PURED: a unified framework for resource-hard functions
- Trapdoor memory-hard functions
- The impact of reversibility on parallel pebbling
- Cumulative memory lower bounds for randomized and quantum computation
This page was built for publication: Balloon hashing: a memory-hard function providing provable protection against sequential attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958121)
