Publication Type : Journal Article
Publisher : International Journal of Pure and Applied Mathematics
Source : International Journal of Pure and Applied Mathematics, Academic Press, Volume 118, Number 7 Special Issue, p.381-385 (2018)
Url : https://acadpubl.eu/jsi/2018-118-7-9/articles/7/51.pdf
Keywords : E-Banking, Partial Passwords, Vector decomposition problem
Campus : Coimbatore
School : School of Engineering
Center : TIFAC CORE in Cyber Security
Department : Computer Science, Mathematics, cyber Security
Year : 2018
Abstract : Validation using partial passwords is a mode of authentication which is used in financial sector. This mode of authentication enhances security against attckers attemting to retrieve password by not allowing to realize the full password in a single attempt. Since the studies regarding partial password authentication are available comparatively less in the academic literature, many queries regarding it remain unanswered. In this paper, we propose a scheme for partial password authentication based on vector decomposition problem. The proposed scheme is based on a two-party protocol to securely evaluate 2DNF formula in higher dimensional vector spaces, using vector decomposition problem. The proposed scheme permits the user to select the arbitrary characters of the actual password to be entered, in random order.
Cite this Research Publication : I. Praveen and Dr. M. Sethumadhavan, “Partial Password Authentication using Vector Decomposition”, International Journal of Pure and Applied Mathematics, vol. 118, pp. 381-385, 2018.