A secure key authentication scheme for cryptosystems based on GDLP and IFP

Meshram, Chandrashekhar; Lee, Cheng‐Chi; Li, Chun-Ta; Tu, Yu–Kang

doi:10.1007/s00500-016-2440-3

Cited by 22 publications

(15 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The security of our proposed IBC technique depends on an index problem including IFP, and GDLP 10,20‐22,27 in cyclic group

Z_{N}^{*}

that is multiplicative define over finite field. According to Coppersmith attacking method, 28 (n + 1) entity's conspiracy are able to derive the KACs secret information.…”

Section: Security Investigation and Discussionmentioning

confidence: 99%

“…Also, the key distribution system presented. The proposed technique will see suitable for developing a more secure IBC approach with GDLP and IFP as compare to Pang et al 11 Also, formal security proof under the hardness assumption of solving GDLP and IFP 20‐22 have provided.…”

Section: Introductionmentioning

confidence: 90%

“…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 3 more Smart Citations

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

“…The security of our proposed IBC technique depends on an index problem including IFP, and GDLP 10,20‐22,27 in cyclic group

Z_{N}^{*}

that is multiplicative define over finite field. According to Coppersmith attacking method, 28 (n + 1) entity's conspiracy are able to derive the KACs secret information.…”

Section: Security Investigation and Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 90%

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 2 more Smart Citations

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

show abstract

“…Karati et al introduced provably secure ID‐based signcryption technique for crowdsourced mechanical web of things situations. Meshram et al presented a new secure key authentication technique for public key cryptography (PKI) and efficient IBC using GDL and IF. Meshram and Lee presented a secure password authentication technique for PKI using partial DL.…”

Section: Introductionmentioning

confidence: 99%

Chebyshev chaotic map‐based ID‐based cryptographic model using subtree and fuzzy‐entity data sharing for public key cryptography

Meshram

Obaidat

Meshram

2018

Security and Privacy

Self Cite

View full text Add to dashboard Cite

Recently, chaos has been dealt with as a decent approach to reduce computational complexity while fulfilling security necessities of a cryptographic technique. Cloud storage brings strong conveniences for adaptable data sharing. When sharing data with a large number of entities described with fuzzy identities, the data proprietors must use an appropriate ID-based cryptographic (IBC) technique to meet the security and efficiency prerequisites. IBC is a promising candidate to make sure fuzzy-entity data sharing while meeting the security prerequisite, but encounters the efficiency difficulty in multi-receiver settings. In IBC technique distributing public keys for individually entity, technique allows separately entity to select his/her network address or name as her/his public key. This is valuable to public key cryptographic (PKC) technique in light of the fact that the public key confirmation is so informal and direct. In such a mode, a huge public key document is not compulsory. Subsequently novel PKC technique dependably confront security encounters accordingly, the aim of this article is to outline and examination of conversion mechanism subtree and fuzzy-entity data sharing that can transfer PKC's using Chebyshev chaotic map into the IBC technique as opposed to re-concoct another framework. Also, no adjustment of the first Chebyshev chaotic map-based PKC's is vital. KEYWORDSChebyshev chaotic map, fuzzy-entity data sharing, PKC, provable security, subtree-IBC 1 Security Privacy. 2018;1:e12 wileyonlinelibrary.com/journal/spy2

show abstract

An efficient online/offline ID-based short signature procedure using extended chaotic maps

Meshram

2018

Soft Comput

View full text Add to dashboard Cite

A secure key authentication scheme for cryptosystems based on GDLP and IFP

Cited by 22 publications

References 32 publications

An efficient ID‐based cryptographic technique using IFP and GDLP

An efficient ID‐based cryptographic technique using IFP and GDLP

Chebyshev chaotic map‐based ID‐based cryptographic model using subtree and fuzzy‐entity data sharing for public key cryptography

An efficient online/offline ID-based short signature procedure using extended chaotic maps

Contact Info

Product

Resources

About