Proofs of security for the Unix password hashing algorithm

DOI10.1007/3-540-44448-3_43MaRDI QIDQ2707453zbMATH OpenFDO

Authors David Wagner, Ian Goldberg

Publication date 27 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44448-3_43

zbMATH Keywords

Unix password hashing algorithm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 2063048
• Interpreting hash function security proofs
• On the design of provably-secure cryptographic hash functions
• scientific article; zbMATH DE number 5009198
• The power of primes: security of authentication based on a universal hash-function family
• Progress in Cryptology - INDOCRYPT 2003
• A primitive for proving the security of every bit and about universal hash functions \& hard core bits
• Several proofs of security for a tokenization algorithm
• Optimal security proofs for full domain hash, revisited

Cited in

(9)

• A study of password security
• Another step towards realizing random oracles: non-malleable point obfuscation
• Password hashing and preprocessing
• Multi-instance security and its application to password-based cryptography
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Bad directions in cryptographic hash functions
• Reliability check for passwords based on the modified Bloom filter
• Selecting Secure Passwords
• Quantifying the security advantage of password expiration policies

This page was built for publication: Proofs of security for the Unix password hashing algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707453)