Research Article
Effectiveness of Some Tests of Spatial Randomness in the Detection of Weak Graphical Passwords in
149 downloads
@INPROCEEDINGS{10.1007/978-3-030-69839-3_12, author={Joaqu\^{\i}n A. Herrera-Mac\^{\i}as and Lisset Su\^{a}rez-Plasencia and Carlos M. Leg\^{o}n-P\^{e}rez and Luis R. Pi\`{o}eiro-D\^{\i}az and Omar Rojas and Guillermo Sosa-G\^{o}mez}, title={Effectiveness of Some Tests of Spatial Randomness in the Detection of Weak Graphical Passwords in }, proceedings={Computer Science and Health Engineering in Health Services. 4th EAI International Conference, COMPSE 2020, Virtual Event, November 26, 2020, Proceedings}, proceedings_a={COMPSE}, year={2021}, month={7}, keywords={Point pattern Graphical password Ripley’s K function Nearest neighbor distance Passpoint}, doi={10.1007/978-3-030-69839-3_12} }- Joaquín A. Herrera-Macías
Lisset Suárez-Plasencia
Carlos M. Legón-Pérez
Luis R. Piñeiro-Díaz
Omar Rojas
Guillermo Sosa-Gómez
Year: 2021
Effectiveness of Some Tests of Spatial Randomness in the Detection of Weak Graphical Passwords in
COMPSE
Springer
DOI: 10.1007/978-3-030-69839-3_12
Abstract
This paper explores the usability of the Ripley’s K function and the nearest neighbor distance, in the detection of clustered graphical passwords in the graphical authentication stage. For it, both tests were applied to two bases of data of 10, 000 clustered graphical passwords each, the first with graphical passwords clustered in an area lesser than the fourth part of the original image, the second clustered in an area lesser than eighth part of the image. The results show that none of these tests is effective in the detection of clustered graphical passwords, the reason of such failure is due to the short size of the spatial pattern in question, only the 5 points of the graphical password analyzed.
Copyright © 2020–2024 ICST
