Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

A Future-Adaptable Password Scheme

Many authentication schemes depend on secret passwords. Unfortunately, the length and randomness of user-chosen passwords remain fixed over time. In contrast, hardware improvements constantly give attackers increasing computational power. As a result, password schemes such as the traditional UNIX user-authentication system are failing with time.

This paper discusses ways of building systems in which password security keeps up with hardware speeds. We formalize the properties desirable in a good password system, and show that the computational cost of any secure password scheme must increase as hardware improves. We present two algorithms with adaptable cost--eksblowfish, a block cipher with a purposefully expensive key schedule, and bcrypt, a related hash function. Failing a major breakthrough in complexity theory, these algorithms should allow password-based systems to adapt to hardware improvements and remain secure well into the future.

Niels Provos, University of Michigan

David Mazières, OpenBSD Developer

BibTeX
@inproceedings {271659,
author = {Niels Provos and David Mazi{\`e}res},
title = {A {Future-Adaptable} Password Scheme},
booktitle = {1999 USENIX Annual Technical Conference (USENIX ATC 99)},
year = {1999},
address = {Monterey, CA},
url = {https://www.usenix.org/conference/1999-usenix-annual-technical-conference/future-adaptable-password-scheme},
publisher = {USENIX Association},
month = jun
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/usenix99/provos/provos.pdf
Paper (HTML): 
http://usenix.org/publications/library/proceedings/usenix99/provos/provos_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us