A Large-scale Analysis of the Mnemonic Password Advice

被引:10
|
作者
Kiesel, Johannes [1 ]
Stein, Benno [1 ]
Lucks, Stefan [1 ]
机构
[1] Bauhaus Univ Weimar, Weimar, Germany
来源
24TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2017) | 2017年
关键词
SECURITY;
D O I
10.14722/ndss.2017.23077
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
How to choose a strong but still easily memorable password? An often recommended advice is to memorize a random sentence (the mnemonic) and to concatenate the words' initials: a so-called mnemonic password. The paper in hand analyzes the effectiveness of this advice-in terms of the obtained password strength-and sheds light on various related aspects. While it is infeasible to obtain a sufficiently large sample of human-chosen mnemonics, the password strength depends only on the distribution of certain character probabilities. We provide several pieces of evidence that these character probabilities are approximately the same for human-chosen mnemonics and sentences from a web crawl and exploit this connection for our analyses. The presented analyses are independent of cracking software, avoid privacy concerns, and allow full control over the details of how passwords are generated from sentences. In particular, the paper introduces the following original research contributions: (1) construction of one of the largest corpora of human-chosen mnemonics, (2) construction of two web sentence corpora from the 273 TB ClueWeb12 web crawl, (3) demonstration of the suitability of web sentences as substitutes for mnemonics in password strength analyses, (4) improved estimation of password probabilities by position-dependent language models, and (5) analysis of the obtained password strength using web sentence samples of different sentence complexity and using 18 generation rules for mnemonic password construction. Our findings include both expected and less expected results, among others: mnemonic passwords from lowercase letters only provide comparable strength to mnemonic passwords that exploit the 7-bit visible ASCII character set, less complex mnemonics reduce password strength in offline scenarios by less than expected, and longer mnemonic passwords provide more security in an offline but not necessarily in an online scenario. When compared to passwords generated by uniform sampling from a dictionary, distributions of mnemonic passwords can reach the same strength against offline attacks with less characters.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] A Large-Scale Analysis of the Semantic Password Model and Linguistic Patterns in Passwords
    Veras, Rafael
    Collins, Christopher
    Thorpe, Julie
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2021, 24 (03)
  • [2] Password Guessing Time Based on Guessing Entropy and Long-Tailed Password Distribution in the Large-Scale Password Dataset
    Zhang, Shuo
    Zeng, Jianping
    Zhang, Zewen
    PROCEEDINGS OF 2017 11TH IEEE INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY, AND IDENTIFICATION (ASID), 2017, : 6 - 10
  • [3] Large-Scale IoT Devices Firmware Identification Based on Weak Password
    Yu, Dan
    Zhang, Lilong
    Chen, Yongle
    Ma, Yao
    Chen, Junjie
    IEEE ACCESS, 2020, 8 : 7981 - 7992
  • [4] Revisiting Defenses against Large-Scale Online Password Guessing Attacks
    Alsaleh, Mansour
    Mannan, Mohammad
    van Oorschot, P. C.
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2012, 9 (01) : 128 - 141
  • [5] A Large-Scale Evaluation of High-Impact Password Strength Meters
    De Carnavalet, Xavier De Carne
    Mannan, Mohammad
    ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2015, 18 (01) : 1 - 32
  • [6] OPSEC VS Leaked Credentials: Password reuse in Large-Scale Data Leaks
    Uzonyi, David Gabor
    Pitropakis, Nikolaos
    McKeown, Sean
    Politis, Ilias
    2023 IEEE 28TH INTERNATIONAL WORKSHOP ON COMPUTER AIDED MODELING AND DESIGN OF COMMUNICATION LINKS AND NETWORKS, CAMAD 2023, 2023, : 74 - 79
  • [7] Understanding Offline Password-Cracking Methods: A Large-Scale Empirical Study
    Shi, Ruixin
    Zhou, Yongbin
    Li, Yong
    Han, Weili
    SECURITY AND COMMUNICATION NETWORKS, 2021, 2021
  • [8] Towards Quantum Large-Scale Password Guessing on Real-World Distributions
    Duermuth, Markus
    Golla, Maximilian
    Markert, Philipp
    May, Alexander
    Schlieper, Lars
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2021, 2021, 13099 : 412 - 431
  • [9] Large-scale tolerance analysis
    Fimmel, D
    Quitzk, S
    Schwarz, W
    INTERNATIONAL CONFERENCE ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING, 2004, : 33 - 38
  • [10] Large-scale lexical analysis
    Thurmair, Gr.
    Aleksic, V.
    Schwarz, Chr.
    LREC 2012 - EIGHTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, 2012, : 2849 - 2855