Cracking-Resistant Password Vaults using Natural Language Encoders
Date: May 2015
Publication: 36th IEEE Symposium on Security and Privacy
Page(s): 481 - 498
Source 1: https://www.cs.cornell.edu/~rahul/papers/NoCrack.pdf
Source 2: http://www.jbonneau.com/doc/CBJR15-IEEESP-cracking_resistant_password_vaults.pdf
Source 3: http://dx.doi.org/10.1109/SP.2015.36 - Subscription or payment required
Abstract or Summary:
Password vaults are increasingly popular applications that store multiple passwords encrypted under a single master password. User memorizes only the master password to access all of their passwords. Password vaults reduce the burden on users of remembering passwords, but introduces a single point of failure. An attacker that obtains a user’s encrypted vault can mount offline brute-force attacks and, if successful, compromise all of the passwords in the vault. In this paper, we investigate the construction of encrypted vaults that resist such offline cracking attacks and force attackers instead to mount online attacks.
Our contributions are as follows. We present an attack and supporting analysis showing that a previous design for cracking-resistant vaults—-the only one which we are aware of—-actually degrades security relative to conventional password-based approaches. We then introduce a new type of secure encoding scheme that we call a natural language encoder (NLE). An NLE permits the construction of vaults which, when decrypted with the wrong master password, produce plausible- looking decoy passwords. We show how to build NLEs using existing tools from natural language processing, such as n-gram models and probabilistic context-free grammars, and evaluate their ability to generate plausible decoys. Finally, we present, implement, and evaluate a full, NLE-based cracking-resistant vault system called NoCrack.
PasswordResearch.com Note: Project page: https://github.com/rchatterjee/nocrack
Do you have additional information to contribute regarding this research paper? If so, please email email@example.com with the details.