Zipf’s Law in Passwords

By Ding Wang, Haibo Cheng, Ping Wang, Xinyi Huang, Gaopeng Jian. IEEE Transactions on Information Forensics and Security, 2017

485 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Security Analysis of Honeywords (2018, unknown): “Essentially, they make use of the fact that user-chosen passwords follow the Zipf’s law [26], and ranks the sweetwords based on some known probability distribution, either normalized within a user or not.”
Two Birds with One Stone: Two-Factor Authentication with Security Beyond Conventional Bound (2018, methodology): “The server S is provided with a pair of long-term public and private keys (pubkey, prikey) in a public-key based scheme (or a single symmetric key symkey in a symmetric-key based scheme), while each user U ∈ User with identity IDU is equipped with a password PWU which is assumed to be drawn from a Z”