Fast and Efficient UserID Lookup in Distributed Authentication: A Probabilistic Approach Using Bloom Filters

Purshotam S Yadav ()

International Journal of Computing and Engineering, 2024, vol. 6, issue 2, 1 - 16

Abstract: Purpose: User authentication in distributed systems presents unique challenges due to the decentralized nature of these environments and the potential for high-volume login attempts. This paper proposes an efficient method for UserID existence checking during the login process using Bloom filters, a space-efficient probabilistic data structure. Our approach aims to reduce authentication latency and minimize network traffic while maintaining a high level of security. Methodology: We present a novel system architecture that incorporates Bloom filters at strategic points within the distributed system to perform rapid preliminary checks on UserID existence. This method allows for quick rejection of non-existent UserIDs without querying the main user database, significantly reducing the load on central authentication servers. The paper details the implementation of Bloom filters optimized for UserID storage and lookup, including considerations for filter size, hash function selection, and false positive rate management. We also describe the integration of this method into a typical authentication workflow, highlighting the points at which Bloom filter checks are performed and how they interact with existing security measures. Findings: To evaluate the effectiveness of our approach, we conducted extensive experiments simulating various scales of distributed systems and login attempt patterns. Our results demonstrate that the Bloom filter-based UserID existence checking method reduces authentication latency by an average of 37% compared to traditional database lookup methods. Additionally, we observed a 42% decrease in network traffic related to authentication processes, indicating improved scalability for large-scale distributed systems. The paper also discusses the trade-offs inherent in using probabilistic data structures for security-critical operations, addressing potential vulnerabilities and proposing mitigation strategies. We conclude by outlining future research directions, including adaptive Bloom filter sizing and the potential application of this method to other aspects of distributed system security. Unique Contribution to Theory, Policy and Practice: This research contributes to the field of distributed systems security by providing a practical, efficient, and scalable solution for UserID existence checking, potentially improving the performance and user experience of large-scale authentication systems.

Keywords: Distributed Systems; User Authentication; Latency Reduction; Probabilistic Data Structures; Cloud Computing (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
https://carijournals.org/journals/index.php/IJCE/article/view/2124/2512 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bhx:ojijce:v:6:y:2024:i:2:p:1-16:id:2124

Access Statistics for this article

More articles in International Journal of Computing and Engineering from CARI Journals Limited
Bibliographic data for series maintained by Chief Editor ().