Password hashing and preprocessing
From MaRDI portal
Publication:2056723
DOI10.1007/978-3-030-77886-6_3zbMath1479.94317OpenAlexW3172339175MaRDI QIDQ2056723
Stefano Tessaro, Pooya Farshim
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_3
Related Items (1)
Cites Work
- Random oracles and non-uniformity
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Multi-instance Security and Its Application to Password-Based Cryptography
- To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
- High Parallel Complexity Graphs and Memory-Hard Functions
- On obfuscating point functions
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Random Oracles and Auxiliary Input
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- Advances in Cryptology - CRYPTO 2003
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Theory of Cryptography
This page was built for publication: Password hashing and preprocessing