skip to main content
10.1145/508171.508194acmconferencesArticle/Chapter ViewAbstractPublication PagesnspwConference Proceedingsconference-collections
Article

A note on proactive password checking

Published:10 September 2001Publication History

ABSTRACT

Nowadays, proactive password checking algorithms are based on the philosophy of the dictionary attack, and they often fail to prevent some weak passwords with low entropy. In this paper, a new approach is proposed to deal with this new class of weak passwords by (roughly) measuring entropy. A simple example is given to exploit effective patterns to prevent low-entropy passwords as the first step of entropy-based proactive password checking.

References

  1. Steven M. Bellovin and Michael Merritt, Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks, IEEE Symposium on Research in Security and Privacy, May 1992. pp.72-84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. F Bergadano et al. High dictionary compression for proactive password checking, ACM trans. on info and system security Vol.1, No.1, Nov. 1998 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F Bergadano et al. Proactive password checking with decision trees, 1997 ACM conference on computer and communications security, 1997, Zurich Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Burton Bloom. Space/time trade-offs in hash coding with allowable errors, CACM, 13(7): 422-426, July 1979 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Davies and R. Ganesan. BApasswd: A new proactive password checker. In 16th National Computer Security Conference, pages 1-15, Baltimore, MD, Sept. 1993Google ScholarGoogle Scholar
  6. DV Klein. Foiling the Cracker; A Survey of, and Improvements to Unix Password Security, Proceedings of the USENIX Security Workshop. Portland, Oregon: USENIX Association, Summer 1990; expanded as a technical report from SEI, 1992Google ScholarGoogle Scholar
  7. Alec Muffett. Crack 4.0, 5.0, almost everywhere in the internetGoogle ScholarGoogle Scholar
  8. Alec Muffett. CrackLib: a proactive password sanity ibrary, http://www.users.dircon.co.uk/~crypto/download/cracklib,2.7.txtGoogle ScholarGoogle Scholar
  9. Npassword source code (Latest version: npasswd-2.X.tar.gz). at http://www.utexas.edu/cc/unix/software/npasswd/dist/npasswd-2.05.tar.gz, 2000Google ScholarGoogle Scholar
  10. S. Patel, Number theoretic attacks on secure password schemes. IEEE Symposium on Security and Privacy, 1997 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. E. H. Spafford. OPUS: Preventing Weak Password Choices, Computers and Security 11(3), pp. 273-278, 1992 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. T. Wu, The Secure Remote Password Protocol, in Proceedings of the 1998 Internet Society Symposium on Network and Distributed System Security, San Diego, CA, Mar 1998, pp. 97-111.Google ScholarGoogle Scholar
  13. T. Wu, A Real-World Analysis of Kerberos Password Security, Proceedings of the 1999 Network and Distributed System Security Symposium, February 3-5, 1999Google ScholarGoogle Scholar
  14. Jianxin (Jeff) Yan, Alan Blackwell, Ross Anderson and Alasdair Grant. The Memorability and Security of Passwords -- Some Empirical Results. Technical Report No. 500, Computer Laboratory, University of Cambridge,2000. http://www.ftp.clcamacuk/ftp/users/ja14/tr500.pdfGoogle ScholarGoogle Scholar

Index Terms

  1. A note on proactive password checking

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                NSPW '01: Proceedings of the 2001 workshop on New security paradigms
                September 2001
                157 pages
                ISBN:1581134576
                DOI:10.1145/508171

                Copyright © 2001 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 10 September 2001

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                Overall Acceptance Rate62of170submissions,36%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader