Graph coloring for enforcing password identification against brute force attacks

Juan M. Gutiérrez Cárdenas, Wilfredo Bardales Roncalla, Lenin Orihuela Ordonez

Research output: Contribution to conferencePaper (Contribution to a conference)

Abstract

Password Identification or Weak Authentication is one of the weakest points in accessing a system and a suitable point for recurrent attacks of crackers or sniffers. Breakdowns ranging from dictionary brute force attacks to password guesses have shown the increasing need for new types of identification forms based not only on characters' combination, but also taking into account the inherent advantages of the so-called Graphical Passwords. Using graph coloring for a password based system has always been an interesting proposal, but one of its main drawbacks was to teach the user some basic concepts of Graph Theory and also some Graph Coloring Algorithms. The following research tries to establish the usefulness of using password identification with graph coloring applied to graphical passwords, so that a common user could take advantage of this technique in a simplistic manner.
Original languageAmerican English
Pages258-263
Number of pages6
StatePublished - 1 Dec 2008
Externally publishedYes
Event23rd International Conference on Computers and Their Applications, CATA 2008 -
Duration: 1 Dec 2008 → …

Conference

Conference23rd International Conference on Computers and Their Applications, CATA 2008
Period1/12/08 → …

Fingerprint Dive into the research topics of 'Graph coloring for enforcing password identification against brute force attacks'. Together they form a unique fingerprint.

  • Cite this

    Gutiérrez Cárdenas, J. M., Roncalla, W. B., & Ordonez, L. O. (2008). Graph coloring for enforcing password identification against brute force attacks. 258-263. Paper presented at 23rd International Conference on Computers and Their Applications, CATA 2008, .