Qualification: 
MSc
i_praveen@cb.amrita.edu

Praveen I. currently serves as Assistant Professor (Sr. Gr.) in the Department of Mathematics, School of Engineering, Coimbatore Campus. His areas of research include Cryptography, Network Security.

Publications

Publication Type: Journal Article

Year of Publication Title

2018

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.[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.

More »»

2016

I. Praveen, Rajeev, K., and Sethumadhavan, M., “An authenticated key agreement scheme using vector decomposition”, Defence Science Journal, vol. 66, pp. 594-599, 2016.[Abstract]


Encryption using vector decomposition problem (VDP) on higher dimensional vector spaces is a novel method in cryptography. Yoshida has shown that the VDP on a two-dimensional vector space is at least as hard as the computational Diffie-Hellman problem on a one-dimensional subspace under certain conditions. Steven Galbraith has shown that for certain curves, the VDP is at most as hard as the discrete logarithm problem on a one-dimensional subspace. Okomoto and Takashima proposed encryption scheme and signature schemes using VDP. An authenticated key agreement scheme using vector decomposition problem is proposed in this paper. © 2016, DESIDOC. More »»

2016

M. Sreedevi and I. Praveen, “Password authentication using vector decomposition”, International Journal of Control Theory and Applications, vol. 9, pp. 4639-4645, 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.

More »»

Publication Type: Book Chapter

Year of Publication Title

2016

D. Nidhin, I. Praveen, and Praveen, K., “Role-Based Access Control for Encrypted Data Using Vector Decomposition”, in Proceedings of the International Conference on Soft Computing Systems: ICSCS 2015, Volume 2, P. L. Suresh and Panigrahi, K. Bijaya, Eds. New Delhi: Springer India, 2016, pp. 123–131.[Abstract]


In this current era, cloud environment has become essential for large-scale data storage which makes it challenging to control and prevent unauthorized access to the data. At the same time trusting the cloud provider’s integrity is also significant. Instead of assuming that the cloud providers are trusted, data owners can store the encrypted data. In 2013, Zhou et al. put forward a role-based encryption scheme (RBE) that integrates encryption with role-based access control (RBAC). In 2008, Okamoto and Takashima introduced a higher dimensional vector decomposition problem (VDP) and a trapdoor bijective function. In this paper, we propose a RBE scheme using VDP.

More »»

Publication Type: Conference Paper

Year of Publication Title

2012

I. Praveen and Dr. M. Sethumadhavan, “A More Efficient and Faster Pairing Computation with Cryptographic Security”, in Proceedings of the First International Conference on Security of Internet of Things, New York, NY, USA, 2012, pp. 145-149.[Abstract]


Pairing is one of the main features that elliptic curves possess. Identity Based Encryption (IBE) is one of the most important applications of pairing based cryptography, which is used in low memory devices. Scott improved the speed of pairing computation using non-supersingular curves, which was recommended in IBE scheme. Ionica and Joux extended this method to other classes of curves with small embedding degree and efficiently computable endomorphism. In this paper, we propose this idea can be further extended using another class of elliptic curves, which provides implementation efficiency. More »»
Faculty Research Interest: