An ID-based cryptographic mechanisms based on GDLP and IFP

Lee

Ranadive

et al. 2020

Int J Communication

Self Cite

Cloud computing technologies have been prospering in recent years and have opened an avenue for a wide variety of forms of adaptable data sharing. Taking advantage of these state-of-the-art innovations, the cloud storage data owner must, however, use a suitable identity-based cryptographic mechanism to ensure the safety prerequisites while sharing data to large numbers of cloud data users with fuzzy identities. As a successful way to guarantee secure fuzzy sharing of cloud data, the identity-based cryptographic technology still faces an effectiveness problem under multireceiver configurations. The chaos theory is considered a reasonable strategy for reducing computational complexity while meeting the cryptographic protocol's security needs. In an identity-based cryptographic protocol, public keys for individual clients are distributed, allowing the clients to separately select their own network identities or names as their public keys. In fact, in a public-key cryptographic protocol, it is for the best that the confirmation of the public key is done in a safe, private manner, because this way the load of storage on the server's side can be considerably relieved. The objective of this paper is to outline and examine a conversion process that can transfer cryptosystems using Chebyshev's chaotic maps over the Galois field to a subtree-based protocol in the cloud computing setting for fuzzy user data sharing, as opposed to reconcocting a different structure. Furthermore, in the design of our conversion process, no adjustment of the original cryptosystem based on chaotic maps is needed. K E Y W O R D Schaotic hash function, Chebyshev chaotic maps, fuzzy user, public key cryptography, subtree | INTRODUCTIONCloud storage has introduced new ways to store, retrieve, and share digital data, making the concept of sharing ondemand information a reality. Cloud storage service suppliers have been merging into cloud information centers these days, and nominal costs are charged for the service of data sharing. Officers in companies and other organizations can easily acquire precious data with the assistance of cloud storage or share the latest information anywhere with other

Section: Introductionmentioning

confidence: 99%

A subtree‐based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing

Lee

Ranadive

et al. 2020

Int J Communication

Self Cite

“…Meshram et al 4 proposed an improved version of IBC 5‐9 . Meshram et al 4 considered the solutions to GDLP as well as IPF, as their security assumptions. Also, their technique has not adopted a bilinear pair.…”

Section: Introductionmentioning

confidence: 99%

An efficient ID‐based cryptographic technique using IFP and GDLP

Meshram¹,

Ibrahim

et al. 2020

Security and Privacy

Self 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.

“…Tsujii and Itoh [21] also proposed an identity-based cryptographic scheme using the DLP with single discrete exponent which uses the ElGamal [22] public key cryptographic scheme. Recently, Meshram [8] used the variant of IFP and DLP to construct their identitybased encryption scheme and proposed many identity-based cryptographic techniques [9][10][11][12] which have been proposed. However, in these techniques, the public key of each entity is not only an identity, it is some random number selected either by the entity or by the trusted authority.…”

Section: Introductionmentioning

confidence: 99%

An efficient identity-based QER cryptographic scheme

Powar

2016

Complex Intell. Syst.

Self Cite

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.