Paper Info
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.
Year
DOI
Venue
2017
10.15388/Informatica.2017.139
INFORMATICA
Keywords
Field
DocType
cryptography, ID-based cryptographic, IFP, GDLP, random oracle
Cryptographic protocol,Computer science,Computer network,Cryptographic primitive,Artificial intelligence,Machine learning
Journal
Volume
Issue
ISSN
28
3
0868-4952
Citations 
PageRank 
References 
5
0.41
0
Authors
4
Name
Order
Citations
PageRank
Chandrashekhar Meshram1567.23
yuhmin229719.20
Cheng-Chi Lee3558.08
Sarita Gajbhiye Meshram4355.50