Affiliations: [1] Department of Mathematics and Computer Science, R D University, Jabalpur (M.P.), India | [2] Department of Mathematics, RTM Nagpur University, Nagpur, India | [3] Department of Mathematics, National Changhua University of Education, Chang-Hua 500, Taiwan, R.O.C. | [4] Department of Library and Information Science, Fu Jen Catholic University, New Taipei 24205, Taiwan, R.O.C. | [5] Department of Photonics and Communication Engineering, Asia University, Wufeng Shiang, Taichung 413, Taiwan, R.O.C. | [6] Department of Water Resources Development & Management, Indian Institute of Technology, Roorkee (Uttrakhand), India, E-mails: [email protected], [email protected], [email protected], [email protected]
Correspondence:
[*]
Corresponding author.
Abstract: ID-based cryptographic protocol is an extremely valuable apparatus in the field of cryptography and has numerous latent applications. The safety of conventional ID-based cryptographic protocol is entirely contingent in light of the safety of private keys. Revelation of private keys needs reissuing all beforehand doled out encryptions. This confinement turns out to be clearer today as key presentation is more regular with expanding utilization of unprotected gadgets and mobile technology. In this context, relieving the loss of key disclosure in ID-based cryptographic protocol is a critical issue. To manage this issue, we present to include onward security into ID-based cryptographic protocol. Besides, we propose another development of indistinguishability-ID-based cryptographic protocol using Integer Factorization Problem (IFP) and Generalized Discrete Logarithm Problem (GDLP) which is semantically protected against Chosen Plaintext Attack (CPA) in random oracle. We show that our presented protocol beats the other standing protocol as far as security, the length of public key and computational cost are concerned. We shed light on some applications and future scope.
Keywords: cryptography, ID-based cryptographic, IFP, GDLP, random oracle
Journal: Informatica, vol. 28, no. 3, pp. 471-484, 2017
