; --------------------------------------------------------------------- ; To submit, log into grace.umd.edu and use the following command: ; /submit 2017 fall ENEE 657 0101 19 passwords.bib ; --------------------------------------------------------------------- ; Required Readings @MISC{ Bonneauc, title = {{35-The Science of Guessing{\_} Analyzing an Anonymized Corpus of 70 Million Passwords.pdf}}, author = {Bonneau, Joseph}, publisher = {IEEE}, abstract = {We report on the largest corpus of user-chosen passwords ever studied, consisting of anonymized password histograms representing almost 70 million Yahoo! users, mit- igating privacy concerns while enabling analysis of dozens of subpopulations based on demographic factors and site usage characteristics. This large data set motivates a thorough sta- tistical treatment of estimating guessing difficulty by sampling from a secret distribution. In place of previously used metrics such as Shannon entropy and guessing entropy, which cannot be estimated with any realistically sized sample, we develop partial guessing metrics including a new variant of guesswork parameterized by an attacker's desired success rate. Our new metric is comparatively easy to approximate and directly relevant for security engineering. By comparing password distributions with a uniform distribution which would provide equivalent security against different forms of guessing attack, we estimate that passwords provide fewer than 10 bits of security against an online, trawling attack, and only about 20 bits of security against an optimal offline dictionary attack. We find surprisingly little variation in guessing difficulty; every identifiable group of users generated a comparably weak password distribution. Security motivations such as the registration of a payment card have no greater impact than demographic factors such as age and nationality. Even pro- active efforts to nudge users towards better password choices with graphical feedback make little difference. More surpris- ingly, even seemingly distant language communities choose the same weak passwords and an attacker never gains more than a factor of 2 efficiency gain by switching from the globally optimal dictionary to a population-specific lists. Keywords-computer}, year = {2012}, keywords = {Joseph Bonneau}, number = {Security and Privacy (SP)}, studentfirstname ={}, studentlastname ={}, summary = {}, contribution1 ={}, contribution2 ={}, contribution3 ={}, contribution4 ={}, contribution5 ={}, weakness1 = {}, weakness2 = {}, weakness3 = {}, weakness4 = {}, weakness5 = {}, interesting = {high/med/low}, opinions = {}, } @ARTICLE{ Melicher2016, title = {{Fast, Lean, and Accurate: Modeling Password Guessability Using Neural Networks}}, author = {Melicher, William and Ur, Blase and Segreti, Sean M and Komanduri, Saranga and Bauer, Lujo and Christin, Nicolas and Cranor, Lorrie Faith}, journal = {Usenix Security}, year = {2016}, isbn = {9781931971324}, studentfirstname ={}, studentlastname ={}, summary = {}, contribution1 ={}, contribution2 ={}, contribution3 ={}, contribution4 ={}, contribution5 ={}, weakness1 = {}, weakness2 = {}, weakness3 = {}, weakness4 = {}, weakness5 = {}, interesting = {high/med/low}, opinions = {}, } ; BibTex cross-references (don't add anything here)