Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/7229
Title: Optimal Discretization for High-Entropy Graphical Passwords
Authors: Bıçakcı, Kemal
Keywords: authentication
password security
graphical passwords
discretization
Issue Date: 2008
Publisher: IEEE
Source: 23rd International Symposium on Computer and Information Sciences -- OCT 27-29, 2008 -- Istanbul, TURKEY
Abstract: In click-based graphical password schemes that allow arbitrary click locations on image, a click should be verified as correct if it is close within a predefined distance to the originally chosen location. This condition should hold even when for security reasons the password hash is stored in the system, not the password itself. To solve this problem, a robust discretization method has been proposed [4], recently. In this paper, we show that previous work on discretization does not give optimal results with respect to the entropy of the graphical passwords and propose a new discretization method to increase the password space. To improve the security further, we also present several methods that use multiple hash computations for password verification.
URI: https://hdl.handle.net/20.500.11851/7229
ISBN: 978-1-4244-2880-9
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

6
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.