论文标题
使用概率数据结构的密码相似性
Password similarity using probabilistic data structures
论文作者
论文摘要
密码应该很容易记住,但是到期政策要求其频繁更改。在这些相互矛盾的要求之间,用户经常采用创造性的方法来执行略有变化,随着时间的流逝,用户陷入了交火。这些方案很容易欺骗最基本的检查,但这些方案导致实际安全性大大降低,因为泄漏的密码(尽管已过期)可以被有效利用为饼干的种子。这项工作描述了一种基于BLOOM过滤器的方法来检测密码相似性,该方法可用于阻止密码重用习惯。所提出的方案本质地混淆了存储的密码,以在数据库泄漏的情况下保护它们,并且可以调节以抗通用的密码分析技术,使其适合于裸露的系统上使用。
Passwords should be easy to remember, yet expiration policies mandate their frequent change. Caught in the crossfire between these conflicting requirements, users often adopt creative methods to perform slight variations over time. While easily fooling the most basic checks for similarity, these schemes lead to a substantial decrease in actual security, because leaked passwords, albeit expired, can be effectively exploited as seeds for crackers. This work describes an approach based on Bloom filters to detect password similarity, which can be used to discourage password reuse habits. The proposed scheme intrinsically obfuscates the stored passwords to protect them in case of database leaks, and can be tuned to be resistant to common cryptanalytic techniques, making it suitable for usage on exposed systems.