Editor/Reviewer loginFrequency : 12 issues per year
Subject : Computer Applications and Technology
ISSN : 2319–8656 (Online)
IJCATR Volume 6 Issue 4
An Examination of the Bloom Filter and its Application in Preventing Weak Password Choices
Nancy Cheng , Fabio Rocca
10.7753/IJCATR0604.1004
keywords : Weak passwords; Bloom filter; Authentication; Security; Web Security.
Choosing weak passwords is a common issue when a system uses username and password as credentials for authentication. In fact, weak passwords may lead to system compromising. Lots of approaches have been proposed to prevent user from selecting weak or guessable passwords. The common approach is to compare a selected password against a list of unacceptable passwords. In this paper we will explain space-efficient method, which is called Bloom Filter, of storing a dictionary passwords. The time complexity in this approach is constant time, no matter how many passwords we have in our dictionary.
@artical{n642017ijcatr06041004,
Title = "An Examination of the Bloom Filter and its Application in Preventing Weak Password Choices",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "6",
Issue ="4",
Pages ="190 - 193",
Year = "2017",
Authors ="Nancy Cheng , Fabio Rocca"}
Bloom Filter and its Application in Preventing Weak Password Choices
The time complexity in Bloom Filter is constant time, no matter how many passwords we have in our dictionary
Bloom filter is a compact data structures for probabilistic representation of a set in order to support membership queries