Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Meshram, Chandrashekhar1; 2 | Tseng, Yuh-Min3 | Lee, Cheng-Chi4; 5; * | Meshram, Sarita Gajbhiye6
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: cs_meshram@rediffmail.com, ymtseng@cc.ncue.edu.tw, cclee@mail.fju.edu.tw, gajbhiyesarita@gmail.com
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
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl