Some Modification in ID-Based Public key Cryptosystem using IFP and DDLP

Recently, an identity-based quadratic exponentiation randomized cryptosystem scheme using the discrete logarithm problem and the integer factorization problem has been developed. Their contribution lies in that they initiated an idea to create the identity-based cryptographic scheme without bilinear pair. This scheme can achieve the security goal of protecting data and prevent the adversary from snooping the encrypted data, and finding the secrete keys. In this paper, we have proposed some modification in setup phase using floor function and super-increasing sequence, and modified the encryption and decryption process in the identity-based quadratic exponentiation randomized cryptographic scheme. We also discuss how to enhance the security of proposed scheme and processing cost of the proposed scheme.

show abstract

“…Applying Meshram and Meshram attacking method [14] to the proposed system, it may be noted that center's secret information may be disclosed.…”

Section: Security Analysis and Discussionmentioning

confidence: 99%

An efficient identity-based QER cryptographic scheme

Meshram

Powar

2016

Complex Intell. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since Pang et al 10 found out two type of deadlock problems in Meshram et al 26 and removed by some modification in IBC technique using GDLP and IFP 10,20‐22,27 and also discussed security of the technique without given formal security proof. But in cryptographic technique‐based manuscript, formal security analysis, and security proof are required with proper justification.…”

Section: Review Of Pang Et Al Ibcmentioning

confidence: 99%

“…GDLP along with IFP 10,20‐22,27 are used in this proposed IBC. The technique has divided into four sub‐algorithms, including Setup, Extraction, Encryption, and the Decryption.…”

Section: The Propose Improved Ibcmentioning

confidence: 99%

See 1 more Smart Citation

An efficient ID‐based cryptographic technique using IFP and GDLP

Meshram¹,

Ibrahim

Meshram

et al. 2020

Security and Privacy

Self Cite

View full text Add to dashboard Cite

Implementing an improved ID‐based cryptographic mechanism is the main objective of the proposed work. In this article, an ID‐based cryptographic (IBC) technique using generalized discrete logarithm problem (GDLP) and the integer factorization problem (IFP) presented by Meshram et al have improved. Meshram et al have given IBC technique without using the bilinear pair and also, reveal that their technique can attain data protection and security objectives. Besides, their technique will deter the adversary from eavesdropping the encrypted information or the secret key of the user. However, it has found that their system carries a deadlock problem. Encryption process, as expected by the user, is not guaranteed to be secure. It is because the user may require private information about key authentication center (KAC), which has kept secret from users. Pang et al have proposed an improved technique that overcomes the deadlock problem. It has found that Pang et al have not discussed the analysis and proofs of security. In this article, generalized discrete logarithms in multiplicative group over finite fields and IFP have used to improve the technique and also a key distribution system has discussed. It has analyzed that the proposed strategy is safer than the technique described by Pang et al. Also, it has found that the proposed technique addresses the deadlock problem.

show abstract

“…However, the scheme is inefficient in that a plain-text message is encrypted bit-by-bit and hence the length of the output ciphertext becomes long. [12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27] have been proposed. But in these schemes, the public key of each entity is not only an identity, but also some random number selected either by the entity or by the trusted authority.…”

Section: Introductionmentioning

confidence: 99%

Discrete Logarithm and Integer Factorization using ID-based Encryption

Meshram¹

2015

Bulletin EEI

Self Cite

View full text Add to dashboard Cite

Shamir proposed the concept of the ID-based Encryption (IBE) Keywords: Public key Cryptosystem (PKC), ID-based Encryption (IBE), Discrete Logarithm (DL) and Integer Factorization (IF) IntroductionIn 1984, Shamir [1] introduced the concept of an identity-based cryptography. In this system, each user needs to visit key authentication center (KAC) and identify himself before joining the network. Once a user's identity is accepted, the KAC will provide him with a secret key. In this way, a user needs only to know the "identity" of his communication partner and the public key of the KAC, together with his secret key, to communicate with others. There is no public file required in this system. However, Shamir did not succeed in constructing an ID-based cryptosystem, but only in constructing an ID-based signature scheme. Since then, much research has been devoted, especially in Japan, to various kinds of ID-based cryptographic schemes. Okamoto et al. [2] proposed an identity-based key distribution system in 1988, and later, Ohta [3] extended their scheme for user identification. These schemes use the RSA public key cryptosystem [4] for operations in modular N, where N is a product of two large primes, and the security of these schemes is based on the computational difficulty of factoring this large composite number N. Tsujii and Itoh [5] have also proposed an ID-based cryptosystem based on the discrete logarithm problem with single discrete exponent which uses the ElGamal public key cryptosystem.In 1991, Maurer and Yacobi [6] developed a non-interactive ID-based public-key distribution system. In their scheme, the public keys are self-authenticated and require no further authentication by certificates. However, some problems with this scheme were found, the scheme was modified and the final version was presented [7]. In 1998, Tseng and Jan [8] improved the scheme proposed by Maurer and Yacobi, and provided a non-interactive ID-based public-key distribution system with multi-objectives such as an ID-based signature scheme, an identification scheme, and a conference key distribution system. In their scheme, the computational complexity of the system is heavy. Therefore, it is necessary to have a powerful computational capability. Harn [9] proposed public key cryptosystem design based on factoring and discrete logarithm whose security is based factoring and discrete logarithm. In 2001, Bonehet. al [10] used a variant of integer factorization problem to construct his ID-based encryption scheme. However, the scheme is inefficient in that a plain-text message is encrypted bit-by-bit and hence the length of the output ciphertext becomes long.

show abstract

Some Modification in ID-Based Public key Cryptosystem using IFP and DDLP

Cited by 6 publications

References 23 publications

An efficient identity-based QER cryptographic scheme

An efficient identity-based QER cryptographic scheme

An efficient ID‐based cryptographic technique using IFP and GDLP

Discrete Logarithm and Integer Factorization using ID-based Encryption

Contact Info

Product

Resources

About