An IND-ID-CPA Secure ID-Based Cryptographic Protocol using GDLP and IFP

Chandrashekhar Meshram, Yuh-Min Tseng, Cheng Chi Lee, Sarita Gajbhiye Meshram

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 languageEnglish
Pages (from-to)471-484
Number of pages14
JournalInformatica (Netherlands)
Volume28
Issue number3
DOIs
Publication statusPublished - 2017 Jan 1

Fingerprint

Integer Factorization
Discrete Logarithm Problem
Cryptographic Protocols
Identity-based
Factorization
Cryptography
Attack
Safety
Mobile Technology
Random Oracle
Disclosure
Costs
Public key
Beat
Encryption
Computational Cost

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

Meshram, Chandrashekhar ; Tseng, Yuh-Min ; Lee, Cheng Chi ; Meshram, Sarita Gajbhiye. / An IND-ID-CPA Secure ID-Based Cryptographic Protocol using GDLP and IFP. In: Informatica (Netherlands). 2017 ; Vol. 28, No. 3. pp. 471-484.
@article{b2ef02e857324e6cb8d7b809668e2ceb,
title = "An IND-ID-CPA Secure ID-Based Cryptographic Protocol using GDLP and IFP",
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.",
author = "Chandrashekhar Meshram and Yuh-Min Tseng and Lee, {Cheng Chi} and Meshram, {Sarita Gajbhiye}",
year = "2017",
month = "1",
day = "1",
doi = "10.15388/Informatica.2017.139",
language = "English",
volume = "28",
pages = "471--484",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "3",

}

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 journalArticle

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 -