Robust Password Security: A Method in Preventing Guessing Attacks and Authenticating Users

The upward trajectory of information systems is marked by constant growth. Despite its widespread use, the enduring challenge of guessing attacks necessitates robust countermeasures. Current solutions, marked by diverse mechanisms and limited transparency, fail to provide real-time effective-ness. These countermeasures often implement thresholds that, upon repeated attempts, lead to the blocking of individuals. However, a drawback arises in the potential to mistakenly block benign users, thereby compromising usability for those lacking malicious intent. This paper introduces an innovative approach to address these challenges, meticulously exploring benign user scenarios to enhance the precision of guessing attack identification. Our proposed method involves breaking user passwords into distinct blocks, utilizing various features such as password length, component order, keyboard layout, real-time and historical attempt patterns, failed login history, and scheduled logins to differentiate hazardous attempts from innocuous ones. This proposed mechanism distinguishes itself through its simplicity and efficacy compared to state-of-the-art solutions. It balances security, usability, and functionality, offering a streamlined implementation to address the evolving complexities of authentication in information systems.

Authors

Institutions

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1109/icict64582.2025.00014
Primary Topic
User Authentication and Security Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Password Security: A Method in Preventing Guessing Attacks and Authenticating Users

Charan Gudla, Feroz Ahmed, Md. Shohel Rana, Md Mehedi Hasan et al.
User Authentication and Security Systems
article

Robust Password Security: A Method in Preventing Guessing Attacks and Authenticating Users

Charan Gudla, Feroz Ahmed, Md. Shohel Rana, Md Mehedi Hasan, Tonmoy Ghosh
article en

Abstract

The upward trajectory of information systems is marked by constant growth. Despite its widespread use, the enduring challenge of guessing attacks necessitates robust countermeasures. Current solutions, marked by diverse mechanisms and limited transparency, fail to provide real-time effective-ness. These countermeasures often implement thresholds that, upon repeated attempts, lead to the blocking of individuals. However, a drawback arises in the potential to mistakenly block benign users, thereby compromising usability for those lacking malicious intent. This paper introduces an innovative approach to address these challenges, meticulously exploring benign user scenarios to enhance the precision of guessing attack identification. Our proposed method involves breaking user passwords into distinct blocks, utilizing various features such as password length, component order, keyboard layout, real-time and historical attempt patterns, failed login history, and scheduled logins to differentiate hazardous attempts from innocuous ones. This proposed mechanism distinguishes itself through its simplicity and efficacy compared to state-of-the-art solutions. It balances security, usability, and functionality, offering a streamlined implementation to address the evolving complexities of authentication in information systems.

University of Massachusetts Dartmouth (US), Daffodil International University (BD), Southeast University (BD), Mississippi State University (US)
Openalex Percentile: Top 77%
User Authentication and Security Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.