Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two

DOI10.1007/978-3-642-39059-3_27zbMATH Open1379.68109OpenAlexW1774219716MaRDI QIDQ5300959FDOQ5300959

Authors: L. F. South, Douglas Stebila 

Publication date: 28 June 2013

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/62027/1/SS13.pdf

Recommendations

• An algorithm for approximate membership checking with application to password security
• Improved Sketching of Hamming Distance with Error Correcting
• On minimal Hamming compatible distances
• DAHash: distribution aware tuning of password hashing costs
• Topics in Cryptology – CT-RSA 2005
• Randomness extraction and asymptotic Hamming distance
• scientific article; zbMATH DE number 6866300

zbMATH Keywords

Bloom filterapproximate string matchingcount-min sketchpassword frequency

Mathematics Subject Classification ID

Data structures (68P05) Authentication, digital signatures and secret sharing (94A62)

This page was built for publication: Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two

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