Open Access Open Access  Restricted Access Subscription or Fee Access

Enhanced Matrix Bloom Filter for Weak Password Identification

Arulanand Natarajan, S. Subramanian, Dr.K. Premalatha

Abstract


A single weak password exposes the entire network to an external threat. Password hacking is one of the most critical and commonly exploited for network security threats. A Bloom Filter (BF) is a simple space-efficient randomized data structure for representing a set in order to support membership queries. This compact representation is the payoff for allowing a small rate of false positives in membership queries; that is, queries might incorrectly recognize an element as member of the set. Matrix Bloom Filter (MBF) uses matrix representation of BFs to represent a data set. The false positive rate of MBF increases when the data set size increases. The proposed Enhanced Matrix Bloom Filter (EMBF) dynamically creates another bloom filter for the row which exceeds the given threshold value. This paper presents the identification of weak password using Enhanced Matrix Bloom Filter. It reduces the false positive rate if the word set size dynamically increases. The results of the experiment are examined on weak passwords and demonstrate the performance of EMBF and BF

Keywords


Bloom Filter, False Positive Rate, Hash Function, Matrix Bloom Filter, Weak Password

Full Text:

PDF

References


N S Artan and H J Chao., ―Multi-packet signature detection using prefix bloom filters‖, Proceedings of IEEE Conference on Global Telecommunications, vol.3, 2005, p.6.

B Bloom, ―Space/time tradeoffs in hash coding with allowable errors‖, Communications of the ACM, Vol.13, No.7, pp. 422–426, 1970.

J Bruck., J Gao and A Jiang., ―Weighted Bloom Filter‖, IEEE International Symposium on Information Theory, pp.2304-2308, 2006,.

F Chang., W Feng and K Li., ―Approximate caches for packet classification‖, Proceedings of Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, vol.4, pp.2196-2207, 2004.

K Cheng., L Xiang., M Iwaihara and K Sangyo., ―Time-decaying Bloom Filters for data streams with skewed distributions‖, 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications, pp.63-69, 2005.

S Cohen and Y Matias, ―Spectral bloom filters‖, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 241-252, 2003.

S Czerwinski., B. Y Zhao., T Hodes., A. D, Joseph and R. Katz, An ―Architecture for a secure service discovery service‖ In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking(MobiCom ‘99), pp. 24—35. New York: ACM Press, 1999.

S Dharmapurikar., P Krishnamurthy and D E Taylor, ―Longest prefix matching using bloom filters‖, IEEE/ACM Transactions on Networking, vol.14, no.2, pp.397-409, 2006.

S. Dharmapurikar, T S Lockwood, P. Krishnamurthy and T. Sproull, ―Deep packet inspection using parallel bloom filters‖, IEEE Computer Society, vol.24, no.1, pp.52-61, 2004.

Dillinger, C. Peter, Manolios, Panagiotis "Fast and accurate bitstate verification for SPIN", Proceedings of the 11th International Spin Workshop on Model Checking Software, Springer-Verlag, Lecture Notes in Computer Science 2989 , 2004a

Dillinger, Peter C. Manolios, Panagiotis, ―Bloom Filters in probabilistic verification‖, Proceedings of the 5th International Conference on Formal Methods in Computer-Aided Design, Springer-Verlag, Lecture Notes in Computer Science 3312, 2004b

D . Fan Wu, K Lu and A Nucci, NIS04-3: Design of Bloom Filter Array for Network Anomaly Detection, Proceedings of IEEE Conference on Global Telecommunications, pp.1-5, 2006.

D. Guo, J Wu, H Chen and X.Luo, ―Theory and network applications of dynamic bloom filters‖, Proceedings of 25th IEEE International Conference on Computer Communications, pp.1-12, 2006.

D.Guo, J Wu , H Chen., Y. Yuan and X. Luo, ―The Dynamic Bloom Filters‖, IEEE Transactions on Knowledge and Data Engineering, vol.22, no. 1, pp.120-133, 2010.

U. Hua, D Feng and B Xiao, ―TBF: an efficient data architecture for metadata server in the object-based storage network‖, Proceedings of 14th IEEE International Conference on Networks, vol.1, pp.1-6, 2006.

Kirsch, Adam, Mitzenmacher, Michael, ―Less hashing, same performance: building a better bloom filter, algorithms‖, 14th Annual European Symposium, Springer-Verlag, Lecture Notes in Computer Science 4168, pp. 456–467, 2006.

M H Lee and Y H Choi., ―A fault-tolerant bloom filter for deep packet inspection‖, 13th Pacific Rim International Symposium on Dependable Computing, pp.389-396, 2007.

M..Mitzenmacher, ―Compressed Bloom filters‖, IEEE/ACM Transactions on Networking, vol.5, no.5, pp.604-612, 2002.

Kun Xie, Yinghua Min, Dafang Zhang, Jigang Wen and Gaogang Xie. "scalable bloom filter for membership queries". Proceedings of the 50th Annual IEEE Globe Communications Conference (IEEE Globecom 2007) . Washington DC, USA, 2007.

J.K.Mullin and D. J Margoliash, ―A tale of three spelling checkers‖, Software — Practice and Experience Vol. 20, no. 6, pp. 625—630, 1990.

J. Wang, M Xiao and Y Dai ―MBF: a real matrix bloom filter representation method on dynamic set‖, Proceedings of IFIP International Conference on Network and Parallel Computing Workshops, Liaoning , pp. 733 – 736, 2007.

J.Wang, M Xiao, J Jiang and B Min., ―i-DBF: an improved bloom filter representation method on dynamic set‖, Proceedings of Fifth International Conference on Grid and Cooperative Computing Workshops, Hunan, 2006.[23] S. Wang, X Hao , H. Xu and Y. Hu , ―Mining frequent items based on bloom filter‖, Proceedings of Fourth International Conference on Fuzzy Systems and Knowledge Discovery, vol.4, pp.679-683, 2007.

M. Xiao. Y. Dai and X. Li , ―Split Bloom Filter‖, Chinese Journal of Electronic, vol.32, no.2, pp.241-245, 2004.

M. Xiao, X. Kong, J. Liu and J. Ning ―TMBF: Bloom filter algorithms of time-dependent multi bit-strings for incremental set‖, Proceedings of International Conference on Ultra Modern Telecommunications & Workshops, pp.1-4, 2009.

K. Xie, Y. Min, D. Zhang., J. Wen and G. Xie, ―A Scalable bloom filter for membership queries‖, Proceedings of IEEE Conference on Global Telecommunications, Washington, DC, pp. 543 – 547, 2007.

M. Yoon , ―Aging bloom filter with two active buffers for dynamic sets‖, IEEE Transactions on Knowledge and Data Engineering, vol.22, no.1, pp.1134-138, 2010.

Z. Yuan, Y. Chen, Y. Jia and S. Yang, ―Counting evolving data stream based on hierarchical counting bloom filter‖, Proceedings of International Conference on Computational Intelligence and Security, 2008.

G Koloniari and E Pitoura, ―Filters for XML-based service discovery in pervasive computing‖, Computer Journal: Special Issue on Mobile and Pervasive Computing, vol.47, pp.16-27, 2004.

Myeong-Hyeon Lee, Yoon-Hwa Choi, "A fault-tolerant bloom filter for deep packet inspection" 13th Pacific Rim International Symposium on Dependable Computing pp.389-396, 2007.

Arulandand Natarajan and S. Subramanian ―Payload Inspection Using Parallel Bloom Filter in Dual Core Processor‖, Journal of Computer and Information Science, Vol. 3, pp. 215-224, 2010

Arulandand Natarajan, S. Subramanian and K. Premalatha ―Bloom Filters: A Review‖, International Journal of Advanced Research in Computer Science‖, Vol. 1, pp. 248-254.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.