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.
| Original language | English |
|---|---|
| Pages (from-to) | 471-484 |
| Number of pages | 14 |
| Journal | Informatica (Netherlands) |
| Volume | 28 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2017 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
- Applied Mathematics
Cite this
}
An IND-ID-CPA Secure ID-Based Cryptographic Protocol using GDLP and IFP. / Meshram, Chandrashekhar; Tseng, Yuh Min; Lee, Cheng Chi; Meshram, Sarita Gajbhiye.
In: Informatica (Netherlands), Vol. 28, No. 3, 01.01.2017, p. 471-484.Research output: Contribution to journal › Article
TY - JOUR
T1 - An IND-ID-CPA Secure ID-Based Cryptographic Protocol using GDLP and IFP
AU - Meshram, Chandrashekhar
AU - Tseng, Yuh Min
AU - Lee, Cheng Chi
AU - Meshram, Sarita Gajbhiye
PY - 2017/1/1
Y1 - 2017/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85031709167&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85031709167&partnerID=8YFLogxK
U2 - 10.15388/Informatica.2017.139
DO - 10.15388/Informatica.2017.139
M3 - Article
AN - SCOPUS:85031709167
VL - 28
SP - 471
EP - 484
JO - Informatica
JF - Informatica
SN - 0868-4952
IS - 3
ER -