An algorithm for approximate membership checking with application to password security

DOI10.1016/0020-0190(94)00032-8zbMath0807.68037OpenAlexW2154127540WikidataQ114685332 ScholiaQ114685332MaRDI QIDQ1327313

Sun Wu, Udi Manber

Publication date: 18 July 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00032-8

zbMATH Keywords

design of algorithmsapproximate string matchingBloom filterspassword securitySpell checking

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (11)

Improved bounds for dictionary look-up with one error ⋮ Scalable Bloom filters ⋮ Bloom Filters in Adversarial Environments ⋮ Multiple filtration and approximate pattern matching ⋮ Simple, compact and robust approximate string dictionary ⋮ Revisiting multiple pattern matching algorithms for multi-core architecture ⋮ DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE ⋮ A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms ⋮ Index structures for fast similarity search for symbol strings ⋮ Unnamed Item ⋮ An Optimal Bloom Filter Replacement Based on Matrix Solving

Cites Work

• Space/time trade-offs in hash coding with allowable errors
• Unnamed Item

This page was built for publication: An algorithm for approximate membership checking with application to password security