ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Journal Article
Publisher : International Journal of Control Theory and Applications.
Source : International Journal of Control Theory and Applications, Volume 9, Number 10, p.4639-4645 (2016)
Campus : Coimbatore
School : School of Engineering
Department : Mathematics
Year : 2016
Abstract : The vector decomposition problem (VDP) is a computational problem on which security of many public key cryptosystems relies. Yoshida proposed VDP and also proved that VDP on two-dimensional vector space is at least as hard as the computational Diffie-Hellman Problem on its one-dimensional subspace. Okamoto and Takashima generalized VDP into higher dimensional vector spaces and provided a homomorphic encryption scheme. They also provided a protocol to securely evaluate a 2DNF formula. Partial password authentication is a novel method in financial cryptography, an authentication method which requires only arbitrary characters of the existing password. Using the homomorphic encryption scheme of Okamoto and Takashima, we propose a similar protocol to securely evaluate a 2DNF formula which provides partial password authentication. © International Science Press.
Cite this Research Publication : M. Sreedevi and I. Praveen, “Password authentication using vector decomposition”, International Journal of Control Theory and Applications, vol. 9, pp. 4639-4645, 2016.