Security Implications of Password Discretization for Click-Based Graphical Passwords
Date: May 13 2013
Publication: Proceedings of the 22nd international conference on World Wide Web (WWW '13)
Page(s): 1581 - 1591
Source 1: https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/Published.pdf
Source 2: http://telemedicina.unifesp.br/pub/Events/2013-05%20-%20WWW2013/www2013/www2013.org/proceedings/p1581.pdf
Source 3: https://doi.org/10.1145/2488388.2488526 - Subscription or payment required
Abstract or Summary:
Discretization is a standard technique used in click-based graphical passwords for tolerating input variance so that approximately correct passwords are accepted by the system. In this paper, we show for the first time that two representative discretization schemes leak a significant amount of password information, undermining the security of such graphical passwords. We exploit such information leakage for successful dictionary attacks on Persuasive Cued Click Points (PCCP), which is to date the most secure click-based graphical password scheme and was considered to be resistant to such attacks. In our experiments, our purely automated attack successfully guessed 69.2% of the passwords when Centered Discretization was used to implement PCCP, and 39.4% of the passwords when Robust Discretization was used. Each attack dictionary we used was of approximately 2^35 entries, whereas the full password space was of 2^43 entries. For Centered Discretization, our attack still successfully guessed 50% of the passwords when the dictionary size was reduced to approximately 2^30 entries. Our attack is also applicable to common implementations of other click-based graphical password systems such as PassPoints and Cued Click Points -- both have been extensively studied in the research communities.
Do you have additional information to contribute regarding this research paper? If so, please email firstname.lastname@example.org with the details.