Password hashing and preprocessing
From MaRDI portal
Publication:2056723
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- High Parallel Complexity Graphs and Memory-Hard Functions
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-instance security and its application to password-based cryptography
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- On obfuscating point functions
- Random Oracles and Auxiliary Input
- Random oracles and non-uniformity
- Theory of Cryptography
- Time space tradeoffs for attacks against one-way functions and PRGs
- To hash or not to hash again? (In)differentiability results for H^2 and HMAC
Cited in
(6)- DAHash: distribution aware tuning of password hashing costs
- Study on massive-scale slow-hash recovery using unified probabilistic context-free grammar and symmetrical collaborative prioritization with parallel machines
- Multi-instance security and its application to password-based cryptography
- Multi-instance secure public-key encryption
- The query-complexity of preprocessing attacks
- Tight characterizations for preprocessing against cryptographic salting
This page was built for publication: Password hashing and preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056723)